BIROn - Birkbeck Institutional Research Online

    Existentially restricted quantified constraint satisfaction

    Chen, Hubie (2005) Existentially restricted quantified constraint satisfaction. CoRR ,

    Full text not available from this repository.


    The quantified constraint satisfaction problem (QCSP) is a powerful framework for modelling computational problems. The general intractability of the QCSP has motivated the pursuit of restricted cases that avoid its maximal complexity. In this paper, we introduce and study a new model for investigating QCSP complexity in which the types of constraints given by the existentially quantified variables, is restricted. Our primary technical contribution is the development and application of a general technology for proving positive results on parameterizations of the model, of inclusion in the complexity class coNP.


    Item Type: Article
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 09 Mar 2021 15:10
    Last Modified: 09 Mar 2021 15:10


    Activity Overview

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item