Generalized game (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Generalized game" in English language version.

refsWebsite

Global rank English rank

2^nd place

11^th place

8^th place

5^th place

doi.org (Global: 2^nd place; English: 2^nd place)

Reisch, Stefan (1981), "Hex ist PSPACE-vollständig", Acta Informatica, 15 (2): 167–191, doi:10.1007/bf00288964, S2CID 9125259
Iwata, Shigeki; Kasai, Takumi (January 1994), "The Othello game on an $n\times n$ board is PSPACE-complete", Theoretical Computer Science, 123 (2): 329–340, doi:10.1016/0304-3975(94)90131-7
Mishiba, Shohei; Takenaga, Yasuhiko (2020-07-02). "QUIXO is EXPTIME-complete". Information Processing Letters. 162 105995. doi:10.1016/j.ipl.2020.105995. ISSN 0020-0190.
Fraenkel, Aviezri S.; Lichtenstein, David (September 1981), "Computing a perfect strategy for $n\times n$ chess requires time exponential in $n$ ", Journal of Combinatorial Theory, Series A, 31 (2): 199–214, doi:10.1016/0097-3165(81)90016-9
Robson, J. M. (May 1984), " $N$ by $N$ checkers is Exptime complete", SIAM Journal on Computing, 13 (2), Society for Industrial & Applied Mathematics ({SIAM}): 252–267, doi:10.1137/0213018

Reisch, Stefan (1981), "Hex ist PSPACE-vollständig", Acta Informatica, 15 (2): 167–191, doi:10.1007/bf00288964, S2CID 9125259

Mishiba, Shohei; Takenaga, Yasuhiko (2020-07-02). "QUIXO is EXPTIME-complete". Information Processing Letters. 162 105995. doi:10.1016/j.ipl.2020.105995. ISSN 0020-0190.