Combinatorica

, Volume 10, Issue 1, pp 107–109

On recognizing integer polyhedra

  • C. H. Papadimitriou
  • M. Yannakakis
Note

Abstract

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

AMS subject classification (1980)

68Q25 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A.Schrijver,Theory of Linear and Integer Programming, Wiley-Interscience, 1986.Google Scholar

Copyright information

© Akadémiai Kiadó 1990

Authors and Affiliations

  • C. H. Papadimitriou
    • 1
  • M. Yannakakis
    • 2
  1. 1.Dep. of Computer Science and EngineeringUniv. of California at San DiegoUSA
  2. 2.AT & T Bell LaboratoriesMuray HillUSA

Personalised recommendations