Complexity Yardsticks for f-Vectors of Polytopes and Spheres

Eran Nevo

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


We consider geometric and computational measures of complexity for sets of integer vectors, asking for a qualitative difference between f-vectors of simplicial and general d-polytopes, as well as flag f-vectors of d-polytopes and regular CW (d- 1) -spheres, for d≥ 4.

Original languageEnglish
Pages (from-to)347-354
Number of pages8
JournalDiscrete and Computational Geometry
Issue number2
StatePublished - 1 Sep 2020
Externally publishedYes


  • Computational complexity
  • Polytope
  • 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 'Complexity Yardsticks for f-Vectors of Polytopes and Spheres'. Together they form a unique fingerprint.

Cite this