A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(nlogn).
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/disopt/HildebrandK13
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/disopt/HildebrandK13
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Matthias_K%E2%88%9A%E2%88%82ppe
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Robert_Hildebrand
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.disopt.2012.11.003
>
foaf:
homepage
<
https://doi.org/10.1016/j.disopt.2012.11.003
>
dc:
identifier
DBLP journals/disopt/HildebrandK13
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.disopt.2012.11.003
(xsd:string)
dcterms:
issued
2013
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/disopt
>
rdfs:
label
A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(nlogn).
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Matthias_K%E2%88%9A%E2%88%82ppe
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Robert_Hildebrand
>
swrc:
number
1
(xsd:string)
swrc:
pages
69-84
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/disopt/HildebrandK13/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/disopt/HildebrandK13
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/disopt/disopt10.html#HildebrandK13
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.disopt.2012.11.003
>
dc:
title
A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(nlogn).
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
10
(xsd:string)