Graph Isomorphism is in SPP

2006/04/20 by V. Arvind, Piyush P. Kurur · 4 citations
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Quantum Computing Algorithms and Architecture

paper · pdf · doi:10.1016/j.ic.2006.02.002

openalex publication_date 2006/04/20 · crossref created 2006/04/20 · crossref issued 2006/05/01 · crossref published 2006/05/01 · crossref published-print 2006/05/01 · crossref deposited 2025/01/08 · openalex created_date 2025/10/10 · crossref indexed 2026/04/02 · openalex updated_date 2026/07/31

Citations

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Cited by

• Planar Graph Isomorphism is in Log-Space
• Computational complexity theory [wikipedia]
• Graph isomorphism problem [wikipedia]
• P versus NP problem [wikipedia]