This HTML5 document contains 90 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n10https://global.dbpedia.org/id/
dbpedia-ruhttp://ru.dbpedia.org/resource/
dbthttp://dbpedia.org/resource/Template:
dbpedia-ukhttp://uk.dbpedia.org/resource/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n16http://cs.stanford.edu/people/trevisan/pubs/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/
n21http://www.cs.washington.edu/education/courses/533/05au/

Statements

Subject Item
dbr:Carsten_Lund
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Approximation_algorithm
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Interactive_proof_system
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:List_of_numerical_analysis_topics
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Analysis_of_Boolean_functions
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Oded_Regev_(computer_scientist)
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Partial_word
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Clique_problem
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Graph_bandwidth
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Shuchi_Chawla
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Clique_(graph_theory)
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Clique_cover
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Computational_problem
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Hardness_of_approximation
rdfs:label
Складність апроксимації Сложность аппроксимации Hardness of approximation
rdfs:comment
In computer science, hardness of approximation is a field that studies the algorithmic complexity of finding near-optimal solutions to optimization problems. В інформатиці складність апроксимації — це галузь вивчення обчислювальної складності пошуку розв'язків задач оптимізації, близьких до оптимальних. В информатике сложность аппроксимации — это область изучения вычислительной сложности поиска решений задач оптимизации, близких к оптимальным.
dcterms:subject
dbc:Relaxation_(approximation) dbc:Approximation_algorithms dbc:Computational_complexity_theory
dbo:wikiPageID
20677277
dbo:wikiPageRevisionID
1077535213
dbo:wikiPageWikiLink
dbr:Computer_science dbr:NP-hard dbr:PCP_theorem dbr:Venkatesan_Guruswami dbc:Relaxation_(approximation) dbr:Set_cover dbr:Polynomial_time dbr:Approximation_ratio dbr:PCP_(complexity) dbr:Unique_games_conjecture dbr:P_=_NP dbc:Approximation_algorithms dbr:University_of_Washington dbr:Teofilo_F._Gonzalez dbr:Approximation_algorithm dbr:Sartaj_Sahni dbr:NP=P dbr:Computational_complexity_theory dbr:Optimization_problem dbc:Computational_complexity_theory
dbo:wikiPageExternalLink
n16:inapprox.pdf%7Cfirst=Luca%7Clast=Trevisan%7Cauthorlink=Luca n21:
owl:sameAs
n10:4kx82 wikidata:Q5656275 dbpedia-uk:Складність_апроксимації dbpedia-ru:Сложность_аппроксимации yago-res:Hardness_of_approximation freebase:m.0523htj
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Citation
dbo:abstract
В інформатиці складність апроксимації — це галузь вивчення обчислювальної складності пошуку розв'язків задач оптимізації, близьких до оптимальних. В информатике сложность аппроксимации — это область изучения вычислительной сложности поиска решений задач оптимизации, близких к оптимальным. In computer science, hardness of approximation is a field that studies the algorithmic complexity of finding near-optimal solutions to optimization problems.
gold:hypernym
dbr:Field
prov:wasDerivedFrom
wikipedia-en:Hardness_of_approximation?oldid=1077535213&ns=0
dbo:wikiPageLength
2936
foaf:isPrimaryTopicOf
wikipedia-en:Hardness_of_approximation
Subject Item
dbr:Ideal_lattice
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:PCP_theorem
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Probabilistically_checkable_proof
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Maximum_common_induced_subgraph
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Gadget_(computer_science)
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Irit_Dinur
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Janka_Chlebíková
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:K-minimum_spanning_tree
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Uriel_Feige
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Reduction_(complexity)
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Teofilo_F._Gonzalez
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
dbo:knownFor
dbr:Hardness_of_approximation
Subject Item
dbr:Tetris
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Johan_Håstad
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Bipartite_dimension
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Sanjeev_Khanna
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Mihalis_Yannakakis
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Rajeev_Motwani
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Chris_Umans
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
dbp:knownFor
dbr:Hardness_of_approximation
dbo:knownFor
dbr:Hardness_of_approximation
Subject Item
dbr:Long_code_(mathematics)
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Mahjong_solitaire
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Unique_games_conjecture
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
Subject Item
dbr:Hard_to_approximate
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
dbo:wikiPageRedirects
dbr:Hardness_of_approximation
Subject Item
dbr:Inapproximability
dbo:wikiPageWikiLink
dbr:Hardness_of_approximation
dbo:wikiPageRedirects
dbr:Hardness_of_approximation
Subject Item
wikipedia-en:Hardness_of_approximation
foaf:primaryTopic
dbr:Hardness_of_approximation