Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:assumes |
existence of pseudorandom functions
|
| gptkbp:characterizedBy |
constructivity
largeness |
| gptkbp:citation |
many works on circuit complexity
|
| gptkbp:describes |
limitations of certain proof techniques in circuit complexity
|
| gptkbp:field |
theoretical computer science
|
| gptkbp:fullTitle |
gptkb:Natural_Proofs
|
| https://www.w3.org/2000/01/rdf-schema#label |
Natural Proofs
|
| gptkbp:impact |
influenced research in computational complexity
|
| gptkbp:implies |
difficulty of proving strong circuit lower bounds
|
| gptkbp:introduced |
gptkb:Alexander_Razborov
gptkb:Steven_Rudich |
| gptkbp:introducedIn |
1994
|
| gptkbp:notablePublication |
Natural Proofs by Razborov and Rudich (1994)
|
| gptkbp:publishedIn |
gptkb:Journal_of_Computer_and_System_Sciences
|
| gptkbp:relatedTo |
gptkb:P_vs_NP_problem
Boolean circuit lower bounds |
| gptkbp:bfsParent |
gptkb:Gödel_Prize_2011
|
| gptkbp:bfsLayer |
7
|