Universal algebra and hardness results for constraint satisfaction problems

This publication has 22 references indexed in Scilit:

• Affine Systems of Equations and Counting Infinitary Logic
  Lecture Notes in Computer Science, 2007
• Symmetric Datalog and Constraint Satisfaction Problems in Logspace
  2007
• Linear Datalog and Bounded Path Duality of Relational Structures
  Logical Methods in Computer Science, 2005
• The Complexity of Satisfiability Problems: Refining Schaefer’s Theorem
  Lecture Notes in Computer Science, 2005
• Constraint Satisfaction Problems and Finite Algebras
  2000
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
  SIAM Journal on Computing, 1998
• Structure and importance of logspace-MOD class
  Theory of Computing Systems, 1992
• Expressiveness of restricted recursive queries
  1989
• Parity, circuits, and the polynomial-time hierarchy
  Theory of Computing Systems, 1984
• Storage requirements for deterministic polynomialtime recognizable languages
  Journal of Computer and System Sciences, 1976