Embedding Divisor and Semi-Prime Testability in f-Vectors of Polytopes

Eran Nevo

doi:10.1007/s00454-022-00448-y

Embedding Divisor and Semi-Prime Testability in f-Vectors of Polytopes

Eran Nevo^*

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

We obtain computational hardness results for f-vectors of polytopes by exhibiting reductions of the problems DIVISOR and SEMI-PRIME TESTABILITY to problems on f-vectors of polytopes. Further, we show that the corresponding problems for f-vectors of simplicial polytopes are polytime solvable. The situation where we prove this computational difference (conditioned on standard conjectures on the density of primes and on P≠ NP) is when the dimension d tends to infinity and the number of facets is linear in d.

Original language	English
Pages (from-to)	297-303
Number of pages	7
Journal	Discrete and Computational Geometry
Volume	70
Issue number	1
DOIs	https://doi.org/10.1007/s00454-022-00448-y
State	Published - Jul 2023

Bibliographical note

Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.

Keywords

Computational complexity
Polytopes
f-vector

Access to Document

10.1007/s00454-022-00448-y

Cite this

@article{4344d9733a0e4576a01e670633111f49,

title = "Embedding Divisor and Semi-Prime Testability in f-Vectors of Polytopes",

abstract = "We obtain computational hardness results for f-vectors of polytopes by exhibiting reductions of the problems DIVISOR and SEMI-PRIME TESTABILITY to problems on f-vectors of polytopes. Further, we show that the corresponding problems for f-vectors of simplicial polytopes are polytime solvable. The situation where we prove this computational difference (conditioned on standard conjectures on the density of primes and on P≠ NP) is when the dimension d tends to infinity and the number of facets is linear in d.",

keywords = "Computational complexity, Polytopes, f-vector",

author = "Eran Nevo",

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2023",

month = jul,

doi = "10.1007/s00454-022-00448-y",

language = "אנגלית",

volume = "70",

pages = "297--303",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Embedding Divisor and Semi-Prime Testability in f-Vectors of Polytopes

AU - Nevo, Eran

PY - 2023/7

Y1 - 2023/7

N2 - We obtain computational hardness results for f-vectors of polytopes by exhibiting reductions of the problems DIVISOR and SEMI-PRIME TESTABILITY to problems on f-vectors of polytopes. Further, we show that the corresponding problems for f-vectors of simplicial polytopes are polytime solvable. The situation where we prove this computational difference (conditioned on standard conjectures on the density of primes and on P≠ NP) is when the dimension d tends to infinity and the number of facets is linear in d.

AB - We obtain computational hardness results for f-vectors of polytopes by exhibiting reductions of the problems DIVISOR and SEMI-PRIME TESTABILITY to problems on f-vectors of polytopes. Further, we show that the corresponding problems for f-vectors of simplicial polytopes are polytime solvable. The situation where we prove this computational difference (conditioned on standard conjectures on the density of primes and on P≠ NP) is when the dimension d tends to infinity and the number of facets is linear in d.

KW - Computational complexity

KW - Polytopes

KW - f-vector

UR - http://www.scopus.com/inward/record.url?scp=85140339390&partnerID=8YFLogxK

U2 - 10.1007/s00454-022-00448-y

DO - 10.1007/s00454-022-00448-y

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85140339390

SN - 0179-5376

VL - 70

SP - 297

EP - 303

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 1

ER -

Embedding Divisor and Semi-Prime Testability in f-Vectors of Polytopes

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this