Meditations on Quantified Constraint Satisfaction

DOI10.1007/978-3-642-29485-3_4zbMath1354.68113arXiv1201.6306OpenAlexW1528746298MaRDI QIDQ2897943

Hubie Chen

Publication date: 16 July 2012

Published in: Logic and Program Semantics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.6306

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Model theory of finite structures (03C13)

Related Items (12)

Quantified Constraint Satisfaction Problem on Semicomplete Digraphs ⋮ On the Complexity of the Model Checking Problem ⋮ Unnamed Item ⋮ Constraint satisfaction problem: what makes the problem easy ⋮ Quantified Constraints in Twenty Seventeen ⋮ Tractability of quantified temporal constraints to the max ⋮ Decomposing Quantified Conjunctive (or Disjunctive) Formulas ⋮ THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA ⋮ Unnamed Item ⋮ The size of generating sets of powers ⋮ The Complexity of Quantified Constraints Using the Algebraic Formulation ⋮ The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation

This page was built for publication: Meditations on Quantified Constraint Satisfaction