Searching for "GO Is PSPACE Hard" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

3 documents found, showing 1 through 3.

Ladders are PSPACE-complete
by Marcel Crasmaru, John Tromp — 2000
… reduction closely follows that of Lichtenstein and Sipser [LS80], who rst showed PSPACE-hardness of Go…
Cited by 4 (1 self) – Add To MetaCart

The Study of Learning Mechanisms in Unified Theories of Cognition
by Niels A. Taatgen — 1993
…. It has been proven by Lichtenstein and Sipser (1978), that generalized Go is PSPACE-hard. PSPACE-hard…
Add To MetaCart

Combinatorics of Go John Tromp Gunnar Farneb"ack
by unknown authors — 2007
… [7] proved Go PSPACE-hard, while 3 years later, Robson [9] showed Go with thebasic ko rule…
Add To MetaCart

Showing 1 through 3.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB