On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Hans Raj Tiwary, Khaled M. Elbassioni. On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism. In Monique Teillaud, editor, Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008. pages 192-198, ACM, 2008. [doi]

This author has not been identified. Look up 'Hans Raj Tiwary' in GoogleThis author has not been identified. Look up 'Khaled M. Elbassioni' in Google

runs on WebDSL