[antlr-interest] Re: Nondeterminism problem
sarah2geller
sarah2geller at yahoo.com
Wed Dec 24 12:40:46 PST 2003
Clearly, if SLK could solve an NP-complete problem in polynomial
time, that would constitute a proof that P=NP. But the conjecture
given is that P!=NP, so it seems that you misread something.
Yahoo! Groups Links
To visit your group on the web, go to:
http://groups.yahoo.com/group/antlr-interest/
To unsubscribe from this group, send an email to:
antlr-interest-unsubscribe at yahoogroups.com
Your use of Yahoo! Groups is subject to:
http://docs.yahoo.com/info/terms/
More information about the antlr-interest
mailing list