« Back to Record
Citation APA

Tiwary, H. R., & Elbassioni, K. (2008). On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism. Proceedings of the twenty-fourth annual symposium on Computational geometry (June 9-11, 2008: at the University of Maryland in College Park, Maryland, U.S.A)


Permalink

http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/177381

Tiwary, H. R., & Elbassioni, K. (2008). On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism. Proceedings of the twenty-fourth annual symposium on Computational geometry (June 9-11, 2008: at the University of Maryland in College Park, Maryland, U.S.A)