The following pages link to Polynomial-time reduction
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Boolean satisfiability problem (links | edit)
- Co-NP (links | edit)
- Church–Turing thesis (links | edit)
- Computational complexity theory (links | edit)
- Decision problem (links | edit)
- Preorder (links | edit)
- Stephen Cook (links | edit)
- Reductionism (links | edit)
- PSPACE-complete (links | edit)
- Polynomial-time Turing reduction (redirect page) (links | edit)
- NP-easy (links | edit)
- List of computability and complexity topics (links | edit)
- Graph isomorphism problem (links | edit)
- P/poly (links | edit)
- Seinosuke Toda (links | edit)
- Sparse language (links | edit)
- Toda's theorem (links | edit)
- Talk:P/poly (links | edit)
- User:C. lorenz/sandbox (links | edit)
- User:Konetidy/Books/Computational Complexity (links | edit)
- User:C. lorenz/Template:Infobox Complexity Class (links | edit)
- User:C. lorenz/Template:Infobox Complexity Class/doc (links | edit)
- Karp reduction (redirect page) (links | edit)
- Combinatorial optimization (links | edit)
- Complexity class (links | edit)
- List of terms relating to algorithms and data structures (links | edit)
- Turing reduction (links | edit)
- Sparse language (links | edit)
- Talk:P versus NP problem/Archive 1 (links | edit)
- Talk:NP-completeness (links | edit)
- Talk:SWAT and WADS conferences (links | edit)
- User:Wismijlater/sandbox (links | edit)
- User:Jaydavidmartin/Complexity class (links | edit)
- Constraint satisfaction problem (links | edit)
- Many-one reduction (links | edit)
- One-way function (links | edit)
- Complexity class (links | edit)
- Polynomial hierarchy (links | edit)
- FP (complexity) (links | edit)
- NE (complexity) (links | edit)
- Graph homomorphism (links | edit)
- List of terms relating to algorithms and data structures (links | edit)
- Reduction (complexity) (links | edit)
- Log-space reduction (links | edit)
- Turing reduction (links | edit)
- Polynomial-time many-one reduction (redirect page) (links | edit)
- P versus NP problem (links | edit)
- PSPACE (links | edit)
- Co-NP-complete (links | edit)
- EXPTIME (links | edit)
- EXPSPACE (links | edit)
- List of computability and complexity topics (links | edit)
- Subgraph isomorphism problem (links | edit)
- PP (complexity) (links | edit)
- Cook–Levin theorem (links | edit)
- NEXPTIME (links | edit)
- E (complexity) (links | edit)
- PTAS reduction (links | edit)
- True quantified Boolean formula (links | edit)
- Talk:P versus NP problem/Archive 1 (links | edit)
- User:Salix alba/maths/maths redirect frequency (links | edit)
- User:Stellaathena/sandbox (links | edit)
- Misplaced Pages:Proposed article mergers/Archive 2013 (links | edit)
- Concrete security (links | edit)
- L-reduction (links | edit)
- Computer bridge (links | edit)
- Reduction (computability theory) (links | edit)
- Polynomial time reduction (redirect page) (links | edit)
- NP-hardness (links | edit)
- Polynomial reducibility (redirect page) (links | edit)
- Polynomial-time equivalent (redirect page) (links | edit)
- Polynomial time equivalent (redirect page) (links | edit)
- ♯P-completeness of 01-permanent (links | edit)
- NP-completeness (links | edit)
- PPP (complexity) (links | edit)
- PPA (complexity) (links | edit)
- Security of cryptographic hash functions (links | edit)
- Elliptic curve only hash (links | edit)
- SWIFFT (links | edit)
- Isolation lemma (links | edit)
- Periodic graph (geometry) (links | edit)
- Existential theory of the reals (links | edit)
- Ordered set operators (links | edit)
- Polynomial reduction (redirect page) (links | edit)
- Polynomial creativity (links | edit)
- Small set expansion hypothesis (links | edit)
- Talk:Polynomial-time reduction (transclusion) (links | edit)
- Talk:Graph isomorphism/Archive 1 (links | edit)
- Talk:Computational hardness assumption/Archives/ 1 (links | edit)
- User:Salix alba/maths/maths redirect frequency (links | edit)