The following pages link to NP-hard
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- AI-complete (links | edit)
- Boolean satisfiability problem (links | edit)
- P versus NP problem (links | edit)
- Computational complexity theory (links | edit)
- Gaussian elimination (links | edit)
- NP (complexity) (links | edit)
- Quantum computing (links | edit)
- Quantum entanglement (links | edit)
- Regular language (links | edit)
- Tetris (links | edit)
- Travelling salesman problem (links | edit)
- The Art of Computer Programming (links | edit)
- Quadratic programming (links | edit)
- Minimum spanning tree (links | edit)
- Linear programming (links | edit)
- Golomb ruler (links | edit)
- Monotonic function (links | edit)
- Boolean ring (links | edit)
- NP-equivalent (links | edit)
- Genomics (links | edit)
- Load balancing (computing) (links | edit)
- Lemmings (video game) (links | edit)
- Conjunctive normal form (links | edit)
- Sequence alignment (links | edit)
- Phylogenetic tree (links | edit)
- Polynomial-time reduction (links | edit)
- Bayesian network (links | edit)
- Directed acyclic graph (links | edit)
- Combinatorial search (links | edit)
- Computer Go (links | edit)
- Longest common subsequence (links | edit)
- Operator norm (links | edit)
- Cycle space (links | edit)
- Bin packing problem (links | edit)
- Quine–McCluskey algorithm (links | edit)
- Game complexity (links | edit)
- Automatic label placement (links | edit)
- NP (links | edit)
- One-way function (links | edit)
- Tabu search (links | edit)
- Integer programming (links | edit)
- Bottleneck traveling salesman problem (links | edit)
- Graph coloring (links | edit)
- 15 puzzle (links | edit)
- Branch and bound (links | edit)
- Pancake sorting (links | edit)
- 2-satisfiability (links | edit)
- Steiner tree problem (links | edit)
- Complexity class (links | edit)
- Santa Fe Institute (links | edit)