Kernelization of Constraint Satisfaction Problems: A Study Through Universal Algebra
- 23 August 2017
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 157-171
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy CollapsesJournal of the ACM, 2014
- An Effective Dichotomy for the Counting Constraint Satisfaction ProblemSIAM Journal on Computing, 2013
- A survey of clones on infinite setsAlgebra universalis, 2008
- A Simple Algorithm for Mal'tsev ConstraintsSIAM Journal on Computing, 2006
- Classifying the Complexity of Constraints Using Finite AlgebrasSIAM Journal on Computing, 2005
- Learnability of quantified formulasTheoretical Computer Science, 2003
- Which Problems Have Strongly Exponential Complexity?Journal of Computer and System Sciences, 2001
- On the algebraic structure of combinatorial problemsTheoretical Computer Science, 1998
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group TheorySIAM Journal on Computing, 1998
- Closed systems of functions and predicatesPacific Journal of Mathematics, 1968