Skip to main content

On recognizing integer polyhedra

8Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give a simple proof that, determining whether a convex polytope has a fractional vertex, is NP-complete. © 1990 Akadémiai Kiadó.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free