Generating all vertices of a polyhedron is hard

Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich. Generating all vertices of a polyhedron is hard. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006. pages 758-765, ACM Press, 2006. [doi]

Authors

Leonid Khachiyan

This author has not been identified. Look up 'Leonid Khachiyan' in Google

Endre Boros

This author has not been identified. Look up 'Endre Boros' in Google

Konrad Borys

This author has not been identified. Look up 'Konrad Borys' in Google

Khaled M. Elbassioni

This author has not been identified. Look up 'Khaled M. Elbassioni' in Google

Vladimir Gurvich

This author has not been identified. Look up 'Vladimir Gurvich' in Google