Sciweavers

STOC
1994
ACM
123views Algorithms» more  STOC 1994»
13 years 8 months ago
Natural proofs
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