Category:NP-complete problems
See also[edit]
Subcategories
This category has the following 9 subcategories, out of 9 total.
M
- Minesweeper (video game) (4 P)
N
- Number partitioning (12 P)
S
- SAT solvers (7 P)
- SMT solvers (3 P)
T
W
Pages in category "NP-complete problems"
The following 200 pages are in this category, out of approximately 218 total. This list may not reflect recent changes.
(previous page) (next page)B
C
- Canadian traveller problem
- Caterpillar tree
- Chinese postman problem
- Chordal graph
- Chvátal graph
- Circle graph
- Circuit satisfiability problem
- Clique cover
- Clique problem
- Complete bipartite graph
- Complete coloring
- Connected dominating set
- Consensus clustering
- Constraint satisfaction problem
- Crossing number (graph theory)
- Cycle rank
D
E
G
H
I
L
M
- Mahjong solitaire
- Markov model
- Mastermind (board game)
- Masyu
- Matching (graph theory)
- Matchstick graph
- Mathematics of paper folding
- Maximum common induced subgraph
- Maximum coverage problem
- Maximum cut
- Mendelian error
- Metric dimension (graph theory)
- Microsoft Minesweeper
- Minesweeper (video game)
- Minimum k-cut
- Minimum routing cost spanning tree
- Graph minor
- Monochromatic triangle
- Multi-commodity flow problem
- Multipartite graph
- Multiple sequence alignment
- Multivariate cryptography
N
P
S
- S5 (modal logic)
- SameGame
- Satisfiability modulo theories
- Seifert surface
- Set (card game)
- Set cover problem
- Set packing
- Set splitting problem
- Set TSP problem
- Shakashaka
- Shared risk resource group
- Shikaku
- Shortest common supersequence
- Shortest path problem
- Simple polygon
- Single-machine scheduling
- Skew-symmetric graph
- Slitherlink
- Slope number
- Smallest grammar problem
- Sokoban
- Sparse approximation
- Star coloring
- Steiner tree problem
- String graph
- String-to-string correction problem
- Strong connectivity augmentation
- Strong orientation
- Structural alignment
- Subcoloring
- Subgraph isomorphism problem
- Succinct game
- Sudoku
- Synchronizing word