The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/AroraBSS93
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/AroraBSS93
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jacques_Stern
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/L%E2%88%9A%C2%B0szl%E2%88%9A%E2%89%A5_Babai
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sanjeev_Arora
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Z._Sweedyk
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1993.366815
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.1993.366815
>
dc:
identifier
DBLP conf/focs/AroraBSS93
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.1993.366815
(xsd:string)
dcterms:
issued
1993
(xsd:gYear)
rdfs:
label
The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jacques_Stern
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/L%E2%88%9A%C2%B0szl%E2%88%9A%E2%89%A5_Babai
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sanjeev_Arora
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Z._Sweedyk
>
swrc:
pages
724-733
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/FOCS34
>
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/conf/icdt/GuptaS99
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/AroraBSS93/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/AroraBSS93
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs93.html#AroraBSS93
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.1993.366815
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
set-cover problem, hardness, approximate optima, lattices, codes, linear equations, binary codes, NP-hard, polynomial time algorithm, interactive proof systems
(xsd:string)
dc:
title
The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document