The following pages link to NP-hardness
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- PP (complexity) (links | edit)
- Arthur–Merlin protocol (links | edit)
- FP (complexity) (links | edit)
- FNP (complexity) (links | edit)
- NEXPTIME (links | edit)
- Exponential hierarchy (links | edit)
- Elementary recursive function (links | edit)
- Np hard (redirect page) (links | edit)
- Covering problems (links | edit)
- Computable function (links | edit)
- NL (complexity) (links | edit)
- L (complexity) (links | edit)
- FL (complexity) (links | edit)
- SL (complexity) (links | edit)
- RL (complexity) (links | edit)
- Feature selection (links | edit)
- Np-hard (redirect page) (links | edit)
- K-means clustering (links | edit)
- River crossing puzzle (links | edit)
- Regularization (mathematics) (links | edit)
- APX (links | edit)
- P/poly (links | edit)
- Parity P (links | edit)
- IP (complexity) (links | edit)
- RE (complexity) (links | edit)
- R (complexity) (links | edit)
- PR (complexity) (links | edit)
- Spatial analysis (links | edit)
- Cobham's thesis (links | edit)
- Minimum cut (links | edit)
- NL-complete (links | edit)
- TFNP (links | edit)
- PLS (complexity) (links | edit)
- GapP (links | edit)
- Satisfiability modulo theories (links | edit)
- Quantum annealing (links | edit)
- Matching pursuit (links | edit)
- Friction of distance (links | edit)
- Computational hardness assumption (links | edit)
- NP-Hard Problem (redirect page) (links | edit)
- TC0 (links | edit)
- AC0 (links | edit)
- AC (complexity) (links | edit)
- DLOGTIME (links | edit)
- ACC0 (links | edit)
- Grothendieck inequality (links | edit)
- 2-EXPTIME (links | edit)
- Arc routing (links | edit)
- Heuristic (computer science) (links | edit)
- Grzegorczyk hierarchy (links | edit)