Conceptresearch
Natural proofs barrier
Also called Razborov-Rudich barrier.
Explains why natural combinatorial proof methods cannot separate P from NP under cryptographic assumptions.
Explains why natural combinatorial proof methods cannot separate P from NP under cryptographic assumptions.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 4R6J5Y Edit this page History Report an error