Skip to main content
SpringerLink
Log in

On recognizing integer polyhedra

  • Note
  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

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, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

Download references

Author information

Authors and Affiliations

  1. Dep. of Computer Science and Engineering, Univ. of California at San Diego, USA

    C. H. Papadimitriou

  2. AT & T Bell Laboratories, Muray Hill, New Jersey, USA

    M. Yannakakis

Authors
  1. C. H. Papadimitriou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Yannakakis
    View author publications

    You can also search for this author in PubMed Google Scholar

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

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02122701

AMS subject classification (1980)

Search

Navigation