Quantified Constraint Satisfaction Problem on Semicomplete Digraphs
Work
Year: 2017
Type: article
Abstract: We study the (non-uniform) quantified constraint satisfaction problem QCSP( H ) as H ranges over semicomplete digraphs. We obtain a complexity-theoretic trichotomy: QCSP( H ) is either in P, is NP-com... more
Institutions University of Novi Sad, Durham University
Cites: 30
Cited by: 4
Related to: 10
FWCI: 0.385
Citation percentile (by year/subfield): 57.56
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green