NP-complete problems
Topic: Category
From HandWiki - Reading time: 1 min
Here is a list of articles in the category NP-complete problems of the Computing portal that unifies foundations of mathematics and computations using computers. ==See also==
Pages in category "NP-complete problems"
The following 87 pages are in this category, out of 87 total.
H
L
M
S
- SameGame
- (SAT, ε-UNSAT)
- Satisfiability modulo theories
- Set cover problem
- Set packing
- Set splitting problem
- Set TSP problem
- Shakashaka
- Shortest common supersequence
- Shortest common supersequence problem
- Shortest total path length spanning tree
- Slitherlink
- Steiner tree problem
- Subgraph isomorphism problem
- Sudoku
T
Licensed under CC BY-SA 3.0 | Source: https://handwiki.org/wiki/Category:NP-complete_problems6 views | ↧ Download this article as ZWI file
EncycloReader
is supported by the 
KSF