On recognizing integer polyhedra


We give a simple proof that, determining whether a convex polytope has a fractional vertex, is NP-complete.

This is a preview of subscription content, access via your institution.


  1. [1]

    A.Schrijver,Theory of Linear and Integer Programming, Wiley-Interscience, 1986.

Download references

Author information



Additional information

Research supported by the National Science Foundation.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Papadimitriou, C.H., Yannakakis, M. On recognizing integer polyhedra. Combinatorica 10, 107–109 (1990). https://doi.org/10.1007/BF02122701

Download citation

AMS subject classification (1980)

  • 68Q25