Pages that link to "Template:Garey-Johnson"
From HandWiki
The following pages link to Template:Garey-Johnson:
Displayed 20 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- 3-dimensional matching (transclusion) (← links)
- Computational complexity theory (transclusion) (← links)
- Computational complexity (transclusion) (← links)
- Cook–Levin theorem (transclusion) (← links)
- Graph isomorphism (transclusion) (← links)
- NP-completeness (transclusion) (← links)
- List of NP-complete problems (transclusion) (← links)
- P versus NP problem (transclusion) (← links)
- Steiner tree problem (transclusion) (← links)
- Directed acyclic graph (transclusion) (← links)
- Minimum spanning tree (transclusion) (← links)
- Domatic number (transclusion) (← links)
- Intersection number (graph theory) (transclusion) (← links)
- Dominating set (transclusion) (← links)
- NP-equivalent (transclusion) (← links)
- NP-hardness (transclusion) (← links)
- Bipartite half (transclusion) (← links)
- Chordal completion (transclusion) (← links)
- NP-easy (transclusion) (← links)
- Subset sum problem (transclusion) (← links)