Complexity Yardsticks for f-Vectors of Polytopes and Spheres

Eran Nevo*

*Corresponding author for this work

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 languageAmerican English
Pages (from-to)347-354
Number of pages8
JournalDiscrete and Computational Geometry
Issue number2
StatePublished - 1 Sep 2020

Bibliographical note

Publisher Copyright:
© 2019, Springer Science+Business Media, LLC, part of Springer Nature.


  • Computational complexity
  • Polytope
  • f-vector


Dive into the research topics of 'Complexity Yardsticks for f-Vectors of Polytopes and Spheres'. Together they form a unique fingerprint.

Cite this