Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Hardness_of_approximation> ?p ?o }
Showing triples 1 to 54 of
54
with 100 triples per page.
- Hardness_of_approximation abstract "In computer science, hardness of approximation is a field that studies the algorithmic complexity of finding near-optimal solutions to optimization problems.".
- Hardness_of_approximation wikiPageExternalLink inapprox.pdf.
- Hardness_of_approximation wikiPageExternalLink 05au.
- Hardness_of_approximation wikiPageID "20677277".
- Hardness_of_approximation wikiPageLength "2668".
- Hardness_of_approximation wikiPageOutDegree "20".
- Hardness_of_approximation wikiPageRevisionID "671316335".
- Hardness_of_approximation wikiPageWikiLink Approximation_algorithm.
- Hardness_of_approximation wikiPageWikiLink Category:Approximation_algorithms.
- Hardness_of_approximation wikiPageWikiLink Category:Computational_complexity_theory.
- Hardness_of_approximation wikiPageWikiLink Category:Mathematical_optimization.
- Hardness_of_approximation wikiPageWikiLink Computational_complexity_theory.
- Hardness_of_approximation wikiPageWikiLink Computer_science.
- Hardness_of_approximation wikiPageWikiLink Luca_Trevisan.
- Hardness_of_approximation wikiPageWikiLink NP-hard.
- Hardness_of_approximation wikiPageWikiLink NP-hardness.
- Hardness_of_approximation wikiPageWikiLink NP=P.
- Hardness_of_approximation wikiPageWikiLink Optimization_problem.
- Hardness_of_approximation wikiPageWikiLink PCP_(complexity).
- Hardness_of_approximation wikiPageWikiLink PCP_theorem.
- Hardness_of_approximation wikiPageWikiLink P_versus_NP_problem.
- Hardness_of_approximation wikiPageWikiLink Polynomial_time.
- Hardness_of_approximation wikiPageWikiLink Probabilistically_checkable_proof.
- Hardness_of_approximation wikiPageWikiLink Sartaj_Sahni.
- Hardness_of_approximation wikiPageWikiLink Set_cover.
- Hardness_of_approximation wikiPageWikiLink Set_cover_problem.
- Hardness_of_approximation wikiPageWikiLink Teofilo_F._Gonzalez.
- Hardness_of_approximation wikiPageWikiLink Time_complexity.
- Hardness_of_approximation wikiPageWikiLink Unique_games_conjecture.
- Hardness_of_approximation wikiPageWikiLink University_of_Washington.
- Hardness_of_approximation wikiPageWikiLinkText "'''NP'''-hard to approximate".
- Hardness_of_approximation wikiPageWikiLinkText "Hardness of approximation".
- Hardness_of_approximation wikiPageWikiLinkText "NP-hard to approximate".
- Hardness_of_approximation wikiPageWikiLinkText "hard to approximate".
- Hardness_of_approximation wikiPageWikiLinkText "hardness of approximation".
- Hardness_of_approximation wikiPageWikiLinkText "hardness results".
- Hardness_of_approximation wikiPageWikiLinkText "hardness".
- Hardness_of_approximation hasPhotoCollection Hardness_of_approximation.
- Hardness_of_approximation wikiPageUsesTemplate Template:Comp-sci-theory-stub.
- Hardness_of_approximation wikiPageUsesTemplate Template:Reflist.
- Hardness_of_approximation subject Category:Approximation_algorithms.
- Hardness_of_approximation subject Category:Computational_complexity_theory.
- Hardness_of_approximation subject Category:Mathematical_optimization.
- Hardness_of_approximation hypernym Field.
- Hardness_of_approximation type Area.
- Hardness_of_approximation type Area.
- Hardness_of_approximation comment "In computer science, hardness of approximation is a field that studies the algorithmic complexity of finding near-optimal solutions to optimization problems.".
- Hardness_of_approximation label "Hardness of approximation".
- Hardness_of_approximation sameAs m.0523htj.
- Hardness_of_approximation sameAs Сложность_аппроксимации.
- Hardness_of_approximation sameAs Q5656275.
- Hardness_of_approximation sameAs Q5656275.
- Hardness_of_approximation wasDerivedFrom Hardness_of_approximation?oldid=671316335.
- Hardness_of_approximation isPrimaryTopicOf Hardness_of_approximation.