Pages that link to "Polynomial-time reduction"
From HandWiki
The following pages link to Polynomial-time reduction:
Displayed 37 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Computational complexity theory (← links)
- Concrete security (← links)
- Graph homomorphism (← links)
- Isolation lemma (← links)
- NP-completeness (← links)
- One-way function (← links)
- Sharp-P-completeness of 01-permanent (← links)
- Existential theory of the reals (← links)
- Complexity class (← links)
- L-reduction (← links)
- Preorder (← links)
- Decision problem (← links)
- Polynomial hierarchy (← links)
- Boolean satisfiability problem (← links)
- Church–Turing thesis (← links)
- Periodic graph (geometry) (← links)
- PSPACE-complete (← links)
- FP (complexity) (← links)
- Turing reduction (← links)
- Security of cryptographic hash functions (← links)
- Log-space reduction (← links)
- PPA (complexity) (← links)
- NE (complexity) (← links)
- Reduction (recursion theory) (← links)
- Sharp-P-complete (← links)
- PPP (complexity) (← links)
- Co-NP (← links)
- ♯P-completeness of 01-permanent (← links)
- Many-one reduction (← links)
- Ordered set operators (← links)
- Reduction (complexity) (← links)
- SWIFFT (← links)
- Polynomial creativity (← links)
- Elliptic curve only hash (← links)
- Philosophy:Reductionism (← links)
- Biography:Stephen Cook (← links)
- Software:Computer bridge (← links)
