Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Hardness of approximation
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Галузь вивчення обчислювальної складності пошуку розв'язків задач оптимізації
Property
Value
dbo:
description
галузь вивчення обчислювальної складності пошуку розв'язків задач оптимізації
(uk)
галузь вивчення обчислювальної складності пошуку розв'язків задач оптимізації
(uk)
dbo:
wikiPageExternalLink
http://cs.stanford.edu/people/trevisan/pubs/inapprox.pdf%7Cfirst=Luca%7Clast=Trevisan%7Cauthorlink=Luca
http://www.cs.washington.edu/education/courses/533/05au/
dbo:
wikiPageWikiLink
dbr
:Computer_science
dbr
:University_of_Washington
dbr
:Computational_complexity_theory
dbr
:Optimization_problem
dbr
:Approximation_algorithm
dbr
:Sartaj_Sahni
dbr
:Teofilo_F._Gonzalez
dbr
:Venkatesan_Guruswami
dbr
:Unique_games_conjecture
dbr
:PCP_theorem
dbr
:Polynomial_time
dbc
:Approximation_algorithms
dbc
:Computational_complexity_theory
dbc
:Relaxation_(approximation)
dbr
:NP-hard
dbr
:Approximation_ratio
dbr
:NP=P
dbr
:P_=_NP
dbr
:PCP_(complexity)
dbr
:Set_cover
dbp:
wikiPageUsesTemplate
dbt
:Citation
dbt
:Reflist
dct:
subject
dbc
:Approximation_algorithms
dbc
:Computational_complexity_theory
dbc
:Relaxation_(approximation)
gold:
hypernym
dbr
:Field
rdfs:
label
Hardness of approximation
(en)
Складність апроксимації
(uk)
Сложность аппроксимации
(ru)
owl:
sameAs
freebase
:Hardness of approximation
yago-res
:Hardness of approximation
wikidata
:Hardness of approximation
dbpedia-ru
:Hardness of approximation
dbpedia-uk
:Hardness of approximation
dbpedia-global
:Hardness of approximation
prov:
wasDerivedFrom
wikipedia-en
:Hardness_of_approximation?oldid=1239082607&ns=0
foaf:
isPrimaryTopicOf
wikipedia-en
:Hardness_of_approximation
is
dbo:
academicDiscipline
of
dbr
:Ryan_O'Donnell_(computer_scientist)
is
dbo:
knownFor
of
dbr
:Chris_Umans
dbr
:Teofilo_F._Gonzalez
is
dbo:
wikiPageRedirects
of
dbr
:Hard_to_approximate
dbr
:Inapproximability
is
dbo:
wikiPageWikiLink
of
dbr
:Analysis_of_Boolean_functions
dbr
:Ideal_lattice
dbr
:Mahjong_solitaire
dbr
:Clique_(graph_theory)
dbr
:Partial_word
dbr
:List_of_numerical_analysis_topics
dbr
:K-minimum_spanning_tree
dbr
:Clique_cover
dbr
:Johan_Håstad
dbr
:Graph_bandwidth
dbr
:Tetris
dbr
:Approximation_algorithm
dbr
:Carsten_Lund
dbr
:Chris_Umans
dbr
:Interactive_proof_system
dbr
:Irit_Dinur
dbr
:Mihalis_Yannakakis
dbr
:Rajeev_Motwani
dbr
:Sanjeev_Khanna
dbr
:Teofilo_F._Gonzalez
dbr
:Uriel_Feige
dbr
:Probabilistically_checkable_proof
dbr
:Shuchi_Chawla
dbr
:Computational_problem
dbr
:Oded_Regev_(computer_scientist)
dbr
:Clique_problem
dbr
:Reduction_(complexity)
dbr
:Bipartite_dimension
dbr
:Gadget_(computer_science)
dbr
:Unique_games_conjecture
dbr
:PCP_theorem
dbr
:Long_code_(mathematics)
dbr
:Maximum_common_induced_subgraph
dbr
:Janka_Chlebíková
dbr
:Hard_to_approximate
dbr
:Inapproximability
is
dbp:
fields
of
dbr
:Ryan_O'Donnell_(computer_scientist)
is
dbp:
knownFor
of
dbr
:Chris_Umans
is
foaf:
primaryTopic
of
wikipedia-en
:Hardness_of_approximation
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International