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

[Markus Enzenberger <markus.enzenberger@xxxxxxxxxxx>]

On Mon, Oct 23, 2000 at 10:29:38AM -0700, Patrick G. Bridges wrote:

> Except according to a proof in Papadimitrou;s "Computational Complexity", 
> Go is *not* NP, Go is PSPACE-complete, and PSPACE > NP.

Can you give us (non-mathematicians) some enlightenment about the
differences?

- Markus