Pages that link to "Many-one reduction"
Jump to navigation
Jump to search
The following pages link to Many-one reduction:
Displaying 50 items.
- Decision problem (links)
- Preorder (links)
- NP-hardness (links)
- P-complete (links)
- PSPACE-complete (links)
- NP-easy (links)
- Computability theory (links)
- Polynomial-time reduction (links)
- Arithmetical hierarchy (links)
- Clique problem (links)
- Emil Leon Post (links)
- Computability logic (links)
- NE (complexity) (links)
- List of terms relating to algorithms and data structures (links)
- Turing degree (links)
- Post's theorem (links)
- Reduction (complexity) (links)
- Decidability (logic) (links)
- Log-space reduction (links)
- SL (complexity) (links)
- Turing reduction (links)
- Counting problem (complexity) (links)
- Mapping reducibility (redirect page) (links)
- Complement (complexity) (links)
- Karp's 21 NP-complete problems (links)
- Back-and-forth method (links)
- Parity P (links)
- Simple set (links)
- Creative and productive sets (links)
- Myhill isomorphism theorem (links)
- Computable isomorphism (links)
- M-complete (redirect page) (links)
- RE (complexity) (links)
- PR (complexity) (links)
- Schaefer's dichotomy theorem (links)
- Constructive set theory (links)
- Goishi Hiroi (links)
- Gadget (computer science) (links)
- Reduction (computability theory) (links)
- Hyperarithmetical theory (links)
- Mapping reduction (redirect page) (links)
- Holographic algorithm (links)
- Many-one (redirect page) (links)
- Index set (computability) (links)
- Many-one reducible (redirect page) (links)
- Norman Shapiro (links)
- NP-completeness (links)
- Talk:NP-hardness (links)
- Talk:Reduction (complexity) (links)
- Wiki143:WikiProject Mathematics/List of mathematics articles (M) (links)