Generating all vertices of a polyhedron is hard

Discrete and Computational Geometry

Volumn 39, Issue 1-3, 2008, Pages 174-190

  Khachiyan, Leonid ^c   Boros, Endre ^a   Borys, Konrad ^a   Elbassioni, Khaled ^b   Gurvich, Vladimir ^a  

^a RUTGERS UNIVERSITY   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 40349114631     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-008-9050-5     Document Type: Conference Paper

References (44)