English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  On the Complexity of Checking Self-duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism

Tiwary, H. R., & Elbassioni, K. (2008). On the Complexity of Checking Self-duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism. In M. Teillaud, & E. Welzl (Eds.), Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry (SCG'08) (pp. 192-198). New York, NY: ACM. doi:10.1145/1377676.1377707.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Tiwary, Hans Raj1, Author           
Elbassioni, Khaled1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2009-03-3020082008
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 428242
URI: http://doi.acm.org/10.1145/1377676.1377707
Other: Local-ID: C125756E0038A185-028C23D1E0757179C1257553003F51BE-Elbassioni2008a
DOI: 10.1145/1377676.1377707
 Degree: -

Event

show
hide
Title: Twenty-Fourth Annual Symposium on Computational Geometry
Place of Event: College Park, MD, USA,
Start-/End Date: 2008-06-09 - 2008-06-11

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry (SCG'08)
  Abbreviation : SCG 2008
Source Genre: Proceedings
 Creator(s):
Teillaud, Monique1, Editor
Welzl, Emo1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 192 - 198 Identifier: ISBN: 978-1-60558-071-5