A. Adachi, S. Iwata, and T. Kasai. Some combinatorial game problems require (n k) time. J. ACM, 31:361-376, 1984. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
On the Complexity of some Coloring Games - Bodlaender (1989) (10 citations) (Correct)
.... strategy in this game (instance) Several generalizations of well known games, like chess, go, and checkers have been shown to be PSPACE complete or EXPTIME complete [5, 7, 11] Also, PSPACE completeness and EXPTIMF , completeness results have been established for several more abstract games [1, 4, 6, 12, 14, 15]. For an overview, see e.g. 8, 9] In this paper we consider the following game: given are an undirected graph G = V,E) a linear ordering of G (that is: a bijection f: V 1, IVI ) and a finite set of colors C. Players 1 and 2 must alternately color the first uncolored vertex, i.e. player ....
A. Adachi, S. Iwata, and T. Kasai. Some combinatorial game problems require (n k) time. J. ACM, 31:361-376, 1984.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC