Re: On CFL equivalence and graph isomorphism

Christopher Brian Colohan <colohan+@cs.cmu.edu>
25 Apr 2000 02:24:23 -0400

          From comp.compilers
Related articles
On CFL equivalence and graph isomorphism johnston.p@worldnet.att.net (Paul Johnston) (2000-04-20)
Re: On CFL equivalence and graph isomorphism lex@cc.gatech.edu (2000-04-25)
Re: On CFL equivalence and graph isomorphism colohan+@cs.cmu.edu (Christopher Brian Colohan) (2000-04-25)
Re: On CFL equivalence and graph isomorphism pmoisset@altavista.net (Pablo) (2000-04-25)
Re: On CFL equivalence and graph isomorphism ger@informatik.uni-bremen.de (George Russell) (2000-04-26)
Re: On CFL equivalence and graph isomorphism bdm@cs.anu.edu.au (2000-04-26)
Re: On CFL equivalence and graph isomorphism dmolnar@fas.harvard.edu (David A Molnar) (2000-04-27)
Re: On CFL equivalence and graph isomorphism miyazaki@symbolix.cs.uoregon.edu (2000-04-27)
| List of all articles for this month |
From: Christopher Brian Colohan <colohan+@cs.cmu.edu>
Newsgroups: comp.theory,comp.compilers
Date: 25 Apr 2000 02:24:23 -0400
Organization: Carnegie Mellon Univ. -- Computer Science Dept.
Distribution: inet
References: 00-04-140
Keywords: theory, parse

"Paul Johnston" <johnston.p@worldnet.att.net> writes:


> Furthermore, what is the state of solving the Graph Isomorhism
> problem? Is there no hope?


I believe it has been proven to be NP-complete (I need to check in my
Gary&Johnson to be sure, and I am out of town...).


So it is possible to solve, just not in reasonable time given today's
known algorithms. If anyone finds a way of efficiently solving
NP-complete problems, then we will have a great deal to celebrate.




Chris

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.