Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Natural proof

Known as: Natural proofs 
In computational complexity theory, a natural proof is a certain kind of proof establishing that one complexity class differs from another one. While… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Abstract A great deal of work has been done to characterize entire sets of ideation indicators as well as isolated factors of… Expand
Is this relevant?
2016
2016
Based on Hastad's (1986) circuit lower bounds, Linial, Mansour, and Nisan (1993) gave a quasipolytime learning algorithm for AC0… Expand
  • figure 1
Is this relevant?
2016
2016
We study connections between the Natural Proofs of Razborov and Rudich, derandomization, and the problem of proving “weak… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Trade-off (aka Pareto) curves are typically used to represent the trade-off among different objectives in multiobjective… Expand
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This paper chronicles the wide dispersal of Perron's 1907 result on positive matrices into many fields of science. The many… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We introduce the notion ofnaturalproof. We argue that the known proofs of lower bounds on the complexity of explicit Boolean… Expand
Is this relevant?
1995
1995
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomial-sized circuits (P… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We introduce the notion of natural proof. We argue that the known proofs of lower bounds on the complexity of explicit Boolean… Expand
Is this relevant?
Highly Cited
1977
Highly Cited
1977
  • Dexter Kozen
  • 18th Annual Symposium on Foundations of Computer…
  • 1977
  • Corpus ID: 18523719
Two decidable logical theories are presented, one complete for deterministic polynomial time, one complete for polynomial space… Expand
Is this relevant?