Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
117
click to vote
STOC
1994
ACM
123
views
Algorithms
»
more
STOC 1994
»
Natural proofs
15 years 7 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 ...
Alexander A. Razborov, Steven Rudich
claim paper
Read More »