Category:NP-complete problems
Jump to navigation
Jump to search
Subcategories
This category has the following 3 subcategories, out of 3 total.
S
- SAT solvers (4 P)
- Sudoku (6 P)
T
- Tetris (8 P)
Script error: No such module "anchor".Pages in category "NP-complete problems"
The following 88 pages are in this category, out of 88 total.
B
C
H
M
S
- SameGame
- Satisfiability modulo theories
- Set cover problem
- Set packing
- Shikaku
- Shortest common supersequence
- Single-machine scheduling
- Slitherlink
- Smallest grammar problem
- Steiner tree problem
- String-to-string correction problem
- Structural alignment
- Subcoloring
- Subgraph isomorphism problem
- Substructure search
- Sudoku