A taxonomy of problems with fast parallel algorithms
Information and Control
Does co-NP have short interactive proofs?
Information Processing Letters
Graph isomorphism is in the low hierarchy
Journal of Computer and System Sciences
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Parallel tree contraction part 2: further applications
SIAM Journal on Computing
A logspace algorithm for tree canonization (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A very hard log-space counting class
Theoretical Computer Science - Special issue on structure in complexity theory
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization
KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory
The Complexity of Modular Graph Automorphism
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On the Hardness of Graph Isomorphism
SIAM Journal on Computing
Parallel algorithms for permutation groups and graph isomorphism
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
On isomorphism and canonization of tournaments and hypertournaments
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.00 |
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing seems to be easier to compute than for the isomorphism problem of general graphs. We show that tournament isomorphism and tournament automorphism is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, C=L, PL (probabilistic logarithmic space), for logarithmic space modular counting classes ModkL with odd k = 3 and for DET, the class of problems, NC1 reducible to the determinant. These lower bounds have been proven for graph isomorphism, see [21].