Conceptcore
Polynomial-time equivalence of problems
Also called polynomially equivalent problems, interreducibility.
Two problems are equivalent when each reduces to the other in polynomial time, so they have the same complexity.
Two problems are equivalent when each reduces to the other in polynomial time, so they have the same complexity.
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 EXDCQH Edit this page History Report an error