Note

Combinatorica

, Volume 10, Issue 1, pp 107-109

On recognizing integer polyhedra

  • C. H. PapadimitriouAffiliated withDep. of Computer Science and Engineering, Univ. of California at San Diego
  • , M. YannakakisAffiliated withAT & T Bell Laboratories

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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

AMS subject classification (1980)

68Q25