Category:NP-complete problems
Jump to navigation
Jump to search
complexity class  | |||||
| Upload media | |||||
| Instance of |
| ||||
|---|---|---|---|---|---|
| Subclass of | |||||
| Part of |
| ||||
| Facet of |
| ||||
| Has part(s) |
| ||||
| |||||
 | |||||
Subcategories
This category has the following 6 subcategories, out of 6 total.
B
H
- Hamiltonian path problem (11 F)
K
- Knapsack problem (12 F)
S
- Set cover problem (7 F)
T
- Traveling salesman problem (39 F)
V
- Vertex cover problem (14 F)
Media in category "NP-complete problems"
The following 19 files are in this category, out of 19 total.
-
Clases de complejidad.svg 414 × 255; 4 KB
-
Complexity classes (de).svg 414 × 255; 3 KB
-
Complexity classes es.svg 414 × 255; 5 KB
-
Complexity classes sr en.svg 414 × 255; 3 KB
-
Complexity classes-he.png 525 × 253; 29 KB
-
Complexity classes.png 414 × 255; 6 KB
-
Complexity classes.svg 414 × 255; 6 KB
-
Feedback arc set NP-completeness.svg 512 × 512; 3 KB
-
Happy Pi Day - P versus NP (13128334214).jpg 4,597 × 3,060; 3.83 MB
-
NP compl.JPG 619 × 263; 20 KB
-
NP-hardness of pattern language membership svg.svg 772 × 177; 73 KB
-
NP-hardness of pattern language membership.pdf 1,285 × 293; 17 KB
-
P np fr.svg 800 × 500; 9 KB
-
P np np-complete np-hard.svg 800 × 500; 17 KB
-
P np np-completo np-hard.svg 1,052 × 744; 10 KB
-
P NP NP-plena.svg 414 × 255; 3 KB
-
P NP y NP-completo.png 466 × 258; 24 KB
-
Relative NPC chart sr.svg 500 × 550; 8 KB
-
Relative NPC chart.svg 500 × 550; 7 KB
.svg)
.jpg)
