• Citer

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

par Tiwary, Hans Raj ;Elbassioni, Khaled
Référence (June 9-11, 2008: at the University of Maryland in College Park, Maryland, U.S.A), Proceedings of the twenty-fourth annual symposium on Computational geometry
Publication Publié, 2008

Publication dans des actes

• Détails

Titre:	On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
Auteur:	Tiwary, Hans Raj; Elbassioni, Khaled
Informations sur la publication:	(June 9-11, 2008: at the University of Maryland in College Park, Maryland, U.S.A), Proceedings of the twenty-fourth annual symposium on Computational geometry
Statut de publication:	Publié, 2008
Sujet CREF:	Informatique mathématique
	Géométrie combinatoire et convexité
Langue:	N/A
Identificateurs:	urn:isbn:978-1-60558-071-5