Bases for Boolean co-clones

  title={Bases for Boolean co-clones},
  author={Elmar B{\"o}hler and S. Reith and H. Schnoor and H. Vollmer},
  journal={Inf. Process. Lett.},
  • Elmar Böhler, S. Reith, +1 author H. Vollmer
  • Published 2005
  • Computer Science, Mathematics
  • Inf. Process. Lett.
  • The complexity of various problems in connection with Boolean constraints, like, for example, quantified Boolean constraint satisfaction, have been studied recently. Depending on what types of constraints may be used, the complexity of such problems varies. A very interesting observation of the recent past has been that the thus derived classification of constraints can be explained with the help of universal algebra. More precisely, the difficulty of such a constraint problem often depends on… CONTINUE READING

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    An approximation trichotomy for Boolean #CSP
    • 59
    • Highly Influenced
    • PDF
    The expressibility of functions on the boolean domain, with applications to counting CSPs
    • 34
    • PDF
    Partial Polymorphisms and Constraint Satisfaction Problems
    • 39
    Weak bases of Boolean co-clones
    • 16
    • Highly Influenced
    • PDF
    A Complete Classification of the Complexity of Propositional Abduction
    • 50
    • PDF
    Preferred representations of Boolean relations
    • 12
    The weak base method for constraint satisfaction
    • 14
    Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
    • 28
    • PDF


    Publications referenced by this paper.
    The complexity of satisfiability problems
    • 1,806
    • PDF
    Complexity classifications of Boolean constraint satisfaction problems
    • 422
    The complexity of satisfiability problems: Refining Schaefer's theorem
    • 71
    • PDF
    Theories of computability
    • 112
    • PDF
    The two-valued iterative systems of mathematical logic
    • 707
    • PDF
    Boolesche Funktionen und postsche Klassen
    • 44
    Playing with Boolean blocks
    • 2003
    Playing with Boolean blocks , part I : Post ’ s lattice with applications to complexity theory
    • 2003
    Playing with Boolean blocks, part I: Post's lattice with applications to complexity theory
    • 2003