Backdoors into heterogeneous classes of SAT and CSP
Authors:
- Serge GaspersSGSerge Gaspers
- Neeldhara MisraNMNeeldhara Misra
- Sebastian OrdyniakSOSebastian Ordyniak
- Stefan SzeiderSSStefan Szeider
- Stanislav ŽivnýSŽStanislav Živný
Open Access
- 1 May 2017
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 85, 38-56
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Department of Broadband, Communications and the Digital Economy , Australian Government (CZ.1.07/2.3.00/30.0009, DSTO-1209)
- Austrian Science Fund (I836-N23, P26696)
- Engineering and Physical Sciences Research Council (EP/L021226/1)
- Royal Society
- Australian Research Council (DE120101761)
- European Research Council (239962)
This publication has 15 references indexed in Scilit:
- Constraint Satisfaction Problems Solvable by Local Consistency MethodsJournal of the ACM, 2014
- Augmenting tractable fragments of abstract argumentationArtificial Intelligence, 2012
- Constraint satisfaction with bounded treewidth revisitedJournal of Computer and System Sciences, 2010
- Tractability and Learnability Arising from Algebras with Few SubpowersSIAM Journal on Computing, 2010
- Backdoor Sets of Quantified Boolean FormulasJournal of Automated Reasoning, 2008
- A Simple Algorithm for Mal'tsev ConstraintsSIAM Journal on Computing, 2006
- Hypertree Decompositions and Tractable QueriesJournal of Computer and System Sciences, 2002
- Constraints, consistency and closureArtificial Intelligence, 1998
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group TheorySIAM Journal on Computing, 1998
- Closure properties of constraintsJournal of the ACM, 1997