Pages that link to "Polynomial-time reduction"
Jump to navigation
Jump to search
The following pages link to Polynomial-time reduction:
Displaying 34 items.
- Boolean satisfiability problem (links)
- Co-NP (links)
- Church–Turing thesis (links)
- Computational complexity theory (links)
- Decision problem (links)
- Preorder (links)
- Stephen Cook (links)
- Reductionism (links)
- PSPACE-complete (links)
- Polynomial-time Turing reduction (redirect page) (links)
- Karp reduction (redirect page) (links)
- Constraint satisfaction problem (links)
- Many-one reduction (links)
- One-way function (links)
- Complexity class (links)
- Polynomial hierarchy (links)
- FP (complexity) (links)
- NE (complexity) (links)
- Graph homomorphism (links)
- List of terms relating to algorithms and data structures (links)
- Reduction (complexity) (links)
- Log-space reduction (links)
- Turing reduction (links)
- Polynomial-time many-one reduction (redirect to section "Many-one reductions") (links)
- P versus NP problem (links)
- PSPACE (links)
- Co-NP-complete (links)
- EXPTIME (links)
- EXPSPACE (links)
- List of computability and complexity topics (links)
- Subgraph isomorphism problem (links)
- PP (complexity) (links)
- Cook–Levin theorem (links)
- NEXPTIME (links)
- E (complexity) (links)
- PTAS reduction (links)
- True quantified Boolean formula (links)
- Talk:P versus NP problem/Archive 1 (links)
- Concrete security (links)
- L-reduction (links)
- Computer bridge (links)
- Reduction (computability theory) (links)
- Polynomial time reduction (redirect page) (links)
- Polynomial reducibility (redirect page) (links)
- Polynomial-time equivalent (redirect page) (links)
- Polynomial time equivalent (redirect page) (links)
- ♯P-completeness of 01-permanent (links)
- Wiki143:WikiProject Mathematics/List of mathematics articles (P) (links)