All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

QCSP Monsters and the Demise of the Chen Conjecture

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F22%3A10453397" target="_blank" >RIV/00216208:11320/22:10453397 - isvavai.cz</a>

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=Aboakfu9rw" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=Aboakfu9rw</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/3563820" target="_blank" >10.1145/3563820</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    QCSP Monsters and the Demise of the Chen Conjecture

  • Original language description

    We give a surprising classification for the computational complexity of the Quantified Constraint Satisfaction Problem over a constraint language Gamma, QCSP(Gamma), where Gamma is a finite language over three elements that contains all constants. In particular, such problems are in P, NP-complete, co-NP-complete, or PSpace-complete. Our classification refutes the hitherto widely believed Chen Conjecture. Additionally, we show that already on a 4-element domain there exists a constraint language Gamma such that QCSP(Gamma) is DP-complete (from Boolean Hierarchy), and on a 10-element domain there exists a constraint language giving the complexity class Theta(P)(2). Meanwhile, we prove the Chen Conjecture for finite conservative languages Gamma. If the polymorphism clone of such Gamma has the polynomially generated powers property, then QCSP(Gamma) is in NP. Otherwise, the polymorphism clone of Gamma has the exponentially generated powers property and QCSP(Gamma) is PSpace-complete.(1)

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10101 - Pure mathematics

Result continuities

  • Project

  • Continuities

    R - Projekt Ramcoveho programu EK

Others

  • Publication year

    2022

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Journal of the ACM

  • ISSN

    0004-5411

  • e-ISSN

    1557-735X

  • Volume of the periodical

    69

  • Issue of the periodical within the volume

    5

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    44

  • Pages from-to

    35

  • UT code for WoS article

    000885828900005

  • EID of the result in the Scopus database

    2-s2.0-85086769591