Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

STOC
1994
ACM

favoriteEmaildiscussreport

123views Algorithms» more STOC 1994»

Natural proofs

14 years 3 months ago

Download www-math.mit.edu

Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is widely regarded as a serious barrier to proving strong lower bounds in circuit complexity theory. By definition, a natural combinatorial property satisfies two conditions, constructivity and largeness. Our main result is that if the largeness condition is weakened slightly, then not only does the Razborov

Alexander A. Razborov, Steven Rudich

Real-time Traffic

Algorithms | Natural Combinatorial Property | Natural Proofs | So-called Natural Proofs | STOC 1994 |

claim paper

Related Content

» Natural Language Proof Explanation

» On the Strong Normalisation of Natural Deduction with PermutationConversions

» AlmostNatural Proofs

» Pseudorandom Generators Measure Theory and Natural Proofs

» The Naproche Project Controlled Natural Language Proof Checking of Mathematical Texts

» A Natural Axiomatization of Computability and Proof of Churchs Thesis

» A framework for checking proofs naturally

» Decompositions of Natural Numbers From a Case Study in Mathematical Theory Exploration

» Natural Language Dialog with a Tutor System for Mathematical Proofs

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1994
Where	STOC
Authors	Alexander A. Razborov, Steven Rudich

Comments (0)