Definitioncore
Many-one reducibility
Also called computable reduction, m-reduction, mapping reduction.
A ≤m B if a total computable function maps inputs of A to inputs of B preserving membership.
A ≤m B if a total computable function maps inputs of A to inputs of B preserving membership.
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 H3Q7BT Edit this page History Report an error