Re: computer-go: NP-complete problems solved?

["Patrick G. Bridges" <bridges@xxxxxxxxxxxxxx>]

>>>>> "STW" == Sai To Wang <swang@xxxxxxxxxxxxxxxxx> writes:

    >> Now, it turns out that if P = NP, then P = NP = PSPACE, and
    STW> I never heard that, where can I found more information about
    STW> this claim.


    STW> Thanks

My general computation complexity reference is "Computational
COmplexity" by Papadimitrou. As I said before, I'm a systems weenie,
not a theory weenie, so I could very well be wrong about this.

-- 
*** Patrick G. Bridges  	     	bridges@xxxxxxxxxxxxxxxxx ***
***                #include <std/disclaimer.h>		       ***