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

Eran Nevo

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)297-303
Number of pages7
JournalDiscrete and Computational Geometry
Issue number1
StatePublished - 1 Jul 2023
Externally publishedYes


  • Computational complexity
  • Polytopes
  • f-vector

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Embedding Divisor and Semi-Prime Testability in f-Vectors of Polytopes'. Together they form a unique fingerprint.

Cite this