Matches in DBpedia 2016-04 for { ?s ?p <http://dbpedia.org/resource/Strong_NP-completeness> }
Showing triples 1 to 20 of
20
with 100 triples per page.
- Strongly_NP-complete wikiPageRedirects Strong_NP-completeness.
- Strongly_NP-hard wikiPageRedirects Strong_NP-completeness.
- 3-partition_problem wikiPageWikiLink Strong_NP-completeness.
- List_of_terms_relating_to_algorithms_and_data_structures wikiPageWikiLink Strong_NP-completeness.
- Machine_learning wikiPageWikiLink Strong_NP-completeness.
- Multi-commodity_flow_problem wikiPageWikiLink Strong_NP-completeness.
- NP-completeness wikiPageWikiLink Strong_NP-completeness.
- Polynomial-time_approximation_scheme wikiPageWikiLink Strong_NP-completeness.
- Pseudo-polynomial_time wikiPageWikiLink Strong_NP-completeness.
- Restricted_isometry_property wikiPageWikiLink Strong_NP-completeness.
- Strongly_NP-complete wikiPageWikiLink Strong_NP-completeness.
- Strongly_NP-hard wikiPageWikiLink Strong_NP-completeness.
- Unary_numeral_system wikiPageWikiLink Strong_NP-completeness.
- Weak_NP-completeness wikiPageWikiLink Strong_NP-completeness.
- books?vid=ISBN0-7167-1045-5 isCitedBy Strong_NP-completeness.
- books?vid=ISBN3-540-65367-8 isCitedBy Strong_NP-completeness.
- 2a75c5bda01174dbcf1dbe26c7af3a3053a5bc9308010eb4d5a980fcf1566d7b isCitedBy Strong_NP-completeness.
- 322077.322090 isCitedBy Strong_NP-completeness.
- Category:Strongly_NP-complete_problems subject Strong_NP-completeness.
- Strong_NP-completeness primaryTopic Strong_NP-completeness.