The Complexity of Modular Graph Automorphism

DOI10.1137/S0097539799358227zbMath0969.68083OpenAlexW2013279189MaRDI 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

zbMATH Keywords

decision problemsprogram checkingsearch problemsgraph isomorphismgraph automorphismIP protocols

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) General theory for finite permutation groups (20B05)

Related Items

On the asymmetric complexity of the group-intersection problem ⋮ Applications of dimensionality reduction and exponential sums to graph automorphism