ACM Transactions on Algorithms (TALG)
Using ink to expose students' thought processes in CS2/CS7
Proceedings of the 40th ACM technical symposium on Computer science education
Computational complexity of computing a partial solution for the Graph Automorphism problems
Theoretical Computer Science
ITiCSE '09 Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education
OrganicPad: a tablet PC based chemistry tool
Proceedings of the 46th Annual Southeast Regional Conference on XX
On the Complexity of Matroid Isomorphism Problems
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Reductions to graph isomorphism
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Canonizing hypergraphs under abelian group action
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
On hypergraph and graph isomorphism with bounded color classes
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Testing graph isomorphism in parallel by playing a game
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Arthur-Merlin games and the problem of isomorphism testing
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
On the complexity of computing probabilistic bisimilarity
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
The isomorphism problem for k-trees is complete for logspace
Information and Computation
Hardness results for tournament isomorphism and automorphism
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Relating complete and partial solution for problems similar to graph automorphism
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On the resolution complexity of graph non-isomorphism
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC{$^0$} many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every logarithmic space modular class {Mod}$_k$L and for the class DET of problems NC{$^1$} reducible to the determinant. These are the strongest known hardness results for the graph isomorphism problem and imply a randomized logarithmic space reduction from the perfect matching problem to graph isomorphism. We also investigate hardness results for the graph automorphism problem.