Computer Science – Computational Complexity
Scientific paper
2007-08-30
Computer Science
Computational Complexity
Scientific paper
Combining the the results of A.R. Meyer and L.J. Stockmeyer "The Equivalence
Problem for Regular Expressions with Squaring Requires Exponential Space", and
K.S. Booth "Isomorphism testing for graphs, semigroups, and finite automata are
polynomiamlly equivalent problems" shows that graph isomorphism is
PSPACE-complete.
No associations
LandOfFree
Graph Isomorphism is PSPACE-complete does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Graph Isomorphism is PSPACE-complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph Isomorphism is PSPACE-complete will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-205573