The Complexity of Modular Graph Automorphism
From MaRDI portal
Publication:2706110
DOI10.1137/S0097539799358227zbMath0969.68083MaRDI QIDQ2706110
Richard Beigel, Antoni Lozano, V. Arvind
Publication date: 19 March 2001
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539799358227
decision problems; program checking; search problems; graph isomorphism; graph automorphism; IP protocols
68Q25: Analysis of algorithms and problem complexity
68W10: Parallel algorithms in computer science
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
20B05: General theory for finite permutation groups
Related Items
Applications of dimensionality reduction and exponential sums to graph automorphism, On the asymmetric complexity of the group-intersection problem