Definitionintro
NP
Also called nondeterministic polynomial time.
Decision problems whose yes-instances have polynomial-size certificates checkable in polynomial time.
Decision problems whose yes-instances have polynomial-size certificates checkable in polynomial time.
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 2GXX9T Edit this page History Report an error