On the generic complexity of the searching graph isomorphism problem

DOI10.1515/GCC-2015-0015zbMath1343.68099OpenAlexW2405392826MaRDI QIDQ889990

Alexander N. Rybalov

Publication date: 9 November 2015

Published in: Groups, Complexity, Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/gcc-2015-0015

zbMATH Keywords

graph isomorphismgeneric-case complexitysearching graph isomorphism problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Generic amplification of recursively enumerable sets

This page was built for publication: On the generic complexity of the searching graph isomorphism problem