BIROn - Birkbeck Institutional Research Online

    Constraint satisfaction with succinctly specified relations

    Chen, Hubie and Grohe, M. (2006) Constraint satisfaction with succinctly specified relations. In: Creignou, N. and Kolaitis, P.G. and Vollmer, H. (eds.) Complexity of Constraints. Dagstuhl Seminar Proceedings 06401. Internationales Begegnungs- und Forschungszentrum fuer Informatik.

    Full text not available from this repository.

    Abstract

    The general intractability of the constraint satisfaction problem has motivated the study of the complexity of restricted cases of this problem. Thus far, the literature has primarily considered the formulation of the CSP where constraint relations are given explicitly. We initiate the systematic study of CSP complexity with succinctly specified constraint relations.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 09 Mar 2021 14:31
    Last Modified: 09 Mar 2021 14:31
    URI: https://eprints.bbk.ac.uk/id/eprint/43334

    Statistics

    Downloads
    Activity Overview
    0Downloads
    21Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item