Definitionintro
Polynomial-time reduction
Also called Karp reduction, Polynomial-time many-one reduction, many-one reduction, polynomial many-one reduction, polynomial reduction, polynomial-time many-one reduction.
A reduction from A to B computed in polynomial time that maps yes-instances to yes-instances and no-instances to no-instances.
A reduction from A to B computed in polynomial time that maps yes-instances to yes-instances and no-instances to no-instances.
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 TPB4FR Edit this page History Report an error