Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/siamcomp/KhotPV14
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/siamcomp/KhotPV14
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Nisheeth_K._Vishnoi
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Preyas_Popat
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Subhash_Khot
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1137%2F130919623
>
foaf:
homepage
<
https://doi.org/10.1137/130919623
>
dc:
identifier
DBLP journals/siamcomp/KhotPV14
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1137%2F130919623
(xsd:string)
dcterms:
issued
2014
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/siamcomp
>
rdfs:
label
Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Nisheeth_K._Vishnoi
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Preyas_Popat
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Subhash_Khot
>
swrc:
number
3
(xsd:string)
swrc:
pages
1184-1205
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/siamcomp/KhotPV14/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/siamcomp/KhotPV14
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/siamcomp/siamcomp43.html#KhotPV14
>
rdfs:
seeAlso
<
https://doi.org/10.1137/130919623
>
dc:
title
Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
43
(xsd:string)