Pages that link to "Many-one reduction"
From HandWiki
The following pages link to Many-one reduction:
Displayed 41 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Back-and-forth method (← links)
- NP-completeness (← links)
- Complement (complexity) (← links)
- Computability theory (← links)
- Holographic algorithm (← links)
- Preorder (← links)
- Arithmetical hierarchy (← links)
- Decision problem (← links)
- Computability logic (← links)
- Myhill isomorphism theorem (← links)
- Constructive set theory (← links)
- Hyperarithmetical theory (← links)
- Simple set (← links)
- Turing degree (← links)
- Creative and productive sets (← links)
- Post's theorem (← links)
- Counting problem (complexity) (← links)
- Clique problem (← links)
- Berman–Hartmanis conjecture (← links)
- Schaefer's dichotomy theorem (← links)
- PSPACE-complete (← links)
- Parity P (← links)
- NP-hardness (← links)
- Turing reduction (← links)
- PR (complexity) (← links)
- Gadget (computer science) (← links)
- Polynomial-time reduction (← links)
- Log-space reduction (← links)
- RE (complexity) (← links)
- NE (complexity) (← links)
- Parsimonious reduction (← links)
- Karp's 21 NP-complete problems (← links)
- Reduction (recursion theory) (← links)
- PolyL (← links)
- SL (complexity) (← links)
- Reduction (complexity) (← links)
- Polynomial creativity (← links)
- NP-easy (← links)
- Index set (computability) (← links)
- Enumeration reducibility (← links)
- Philosophy:Decidability (logic) (← links)
