The Double-Plane Algorithm: A simple algorithm for the closest vector problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/isita/BlomqvistG18
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/isita/BlomqvistG18
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ferdinand_Blomqvist
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Marcus_Greferath
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.23919%2FISITA.2018.8664371
>
foaf:
homepage
<
https://doi.org/10.23919/ISITA.2018.8664371
>
dc:
identifier
DBLP conf/isita/BlomqvistG18
(xsd:string)
dc:
identifier
DOI doi.org%2F10.23919%2FISITA.2018.8664371
(xsd:string)
dcterms:
issued
2018
(xsd:gYear)
rdfs:
label
The Double-Plane Algorithm: A simple algorithm for the closest vector problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ferdinand_Blomqvist
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Marcus_Greferath
>
swrc:
pages
193-197
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/isita/2018
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/isita/BlomqvistG18/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/isita/BlomqvistG18
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/isita/isita2018.html#BlomqvistG18
>
rdfs:
seeAlso
<
https://doi.org/10.23919/ISITA.2018.8664371
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/isita
>
dc:
title
The Double-Plane Algorithm: A simple algorithm for the closest vector problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document