Matches in DBpedia 2016-04 for { ?s ?p <http://dbpedia.org/resource/Category:Weakly_NP-complete_problems> }
Showing triples 1 to 11 of
11
with 100 triples per page.
- 0-1_knapsack_problem wikiPageWikiLink Category:Weakly_NP-complete_problems.
- Knapsack_problem wikiPageWikiLink Category:Weakly_NP-complete_problems.
- Partition_problem wikiPageWikiLink Category:Weakly_NP-complete_problems.
- Subset_sum_problem wikiPageWikiLink Category:Weakly_NP-complete_problems.
- Weak_NP-completeness wikiPageWikiLink Category:Weakly_NP-complete_problems.
- 0-1_knapsack_problem subject Category:Weakly_NP-complete_problems.
- Knapsack_problem subject Category:Weakly_NP-complete_problems.
- Partition_problem subject Category:Weakly_NP-complete_problems.
- Subset_sum_problem subject Category:Weakly_NP-complete_problems.
- Weak_NP-completeness subject Category:Weakly_NP-complete_problems.
- Category:Pseudo-polynomial_time_algorithms broader Category:Weakly_NP-complete_problems.