Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete

Author： Slany W.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 829-843

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

PSPACE-complete problems for subgroups of free groups and inverse finite automata

By Birget J.-C.   Margolis S.   Meakin J.   Weil P.  

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 247-281

Elsevier

Access to resources Recommend Favorite

A PSPACE-complete fragment of second-order linear logic

By Perrier G.  

Theoretical Computer Science, Vol. 224, Iss. 1, 1999-08 ,pp. : 267-289

Elsevier

Access to resources Recommend Favorite

Rush Hour is PSPACE-complete, or ''Why you should generously tip parking lot attendants''

By Flake G.W.   Baum E.B.  

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 895-911

Elsevier

Access to resources Recommend Favorite

PSPACE-completeness of Modular Supervisory Control Problems*

By Rohloff Kurt   Lafortune Stéphane  

Discrete Event Dynamic Systems, Vol. 15, Iss. 2, 2005-06 ,pp. : 145-167

Springer Publishing Company

Access to resources Recommend Favorite

Complete games with minimum

By Freixas J.   Puente M.A.  

Annals of Operations Research, Vol. 84, Iss. 1, 1998-01 ,pp. : 97-109

Springer Publishing Company

Access to resources Recommend Favorite