Pages that link to "NP (complexity)"
Jump to navigation
Jump to search
The following pages link to NP (complexity):
Displaying 50 items.
- BPP (complexity) (← links)
- BQP (← links)
- P versus NP problem (← links)
- Computational complexity (← links)
- Complexity (← links)
- Computational complexity theory (← links)
- Discrete mathematics (← links)
- Integer factorization (← links)
- Mathematical logic (← links)
- Quantum computing (← links)
- ♯P (← links)
- Theory of computation (← links)
- PSPACE (← links)
- PSPACE-complete (← links)
- EXPTIME (← links)
- Unknot (← links)
- Polynomial-time reduction (← links)
- Interactive proof system (← links)
- Primality test (← links)
- Time hierarchy theorem (← links)
- Probabilistic Turing machine (← links)
- Constraint satisfaction problem (← links)
- Graph isomorphism (← links)
- UP (complexity) (← links)
- Space complexity (← links)
- Second-order logic (← links)
- Many-one reduction (← links)
- Time complexity (← links)
- Combinatorial optimization (← links)
- Graph coloring (← links)
- Commitment scheme (← links)
- Zero-knowledge proof (← links)
- Randomized algorithm (← links)
- 2-satisfiability (← links)
- Complexity class (← links)
- Probabilistically checkable proof (← links)
- Independent set (graph theory) (← links)
- Savitch's theorem (← links)
- NTIME (← links)
- P (complexity) (← links)
- PH (complexity) (← links)
- Polynomial hierarchy (← links)
- Self-stabilization (← links)
- Cook–Levin theorem (← links)
- Arthur–Merlin protocol (← links)
- Function problem (← links)
- NEXPTIME (← links)
- Alternating Turing machine (← links)
- Reduction (complexity) (← links)
- List of unsolved problems in computer science (← links)