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]
@inproceedings{KhachiyanBBEG06,
title = {Generating all vertices of a polyhedron is hard},
author = {Leonid Khachiyan and Endre Boros and Konrad Borys and Khaled M. Elbassioni and Vladimir Gurvich},
year = {2006},
doi = {10.1145/1109557.1109640},
url = {http://doi.acm.org/10.1145/1109557.1109640},
researchr = {https://researchr.org/publication/KhachiyanBBEG06},
cites = {0},
citedby = {0},
pages = {758-765},
booktitle = {Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006},
publisher = {ACM Press},
isbn = {0-89871-605-5},
}