Optimal Bound on the Combinatorial Complexity of Approximating Polytopes.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/talg/AryaAFM22
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/talg/AryaAFM22
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/David_M._Mount
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Guilherme_Dias_da_Fonseca
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Rahul_Arya
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sunil_Arya
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F3559106
>
foaf:
homepage
<
https://doi.org/10.1145/3559106
>
dc:
identifier
DBLP journals/talg/AryaAFM22
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F3559106
(xsd:string)
dcterms:
issued
2022
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/talg
>
rdfs:
label
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/David_M._Mount
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Guilherme_Dias_da_Fonseca
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Rahul_Arya
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sunil_Arya
>
swrc:
number
4
(xsd:string)
swrc:
pages
35:1-35:29
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/talg/AryaAFM22/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/talg/AryaAFM22
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/talg/talg18.html#AryaAFM22
>
rdfs:
seeAlso
<
https://doi.org/10.1145/3559106
>
dc:
title
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
18
(xsd:string)