Publications
Search

Publications :: Search

Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N.

Show publication

On this page you see the details of the selected publication.

    Publication properties
    Title: Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N.
    Rating: (not rated yet)
    Discussion: 0 comments
    Date: 1981
    Publication type: Conference paper
    Authors:
    No. First name Last name Show
    1. Aviezri S. Fraenkel
    2. David Lichtenstein
    Download (by DOI): 10.1007/3-540-10843-2_23
    BibTeX: conf/icalp/FraenkelL81
    DBLP: db/conf/icalp/icalp81.html#FraenkelL81
    Bookmark:

    The following keywords have been assigned to this publication so far. If you have logged in, you can tag this publication with additional keywords.

    Keywords
    No keywords have been assigned to this publication yet.

    If you log in you can tag this publication with additional keywords

    A publication can refer to another publication (outgoing references) or it can be referred to by other publications (incoming references).

    Incoming References
    No incoming references have been assigned to this publication yet.
    Outgoing References
    No outgoing references have been assigned to this publication yet.

    If you log in you can add references to other publications

    A publication can be assigned to a conference, a journal or a school.

    Conference
    Name: Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings 1981
    DBLP: db/conf/icalp/icalp81.html