Bases for Boolean co-clones

  title={Bases for Boolean co-clones},
  author={Elmar B{\"o}hler and Steffen Reith and Henning Schnoor and Heribert Vollmer},
  journal={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 contraint problem often depends on… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
31 Citations
8 References
Similar Papers


Publications referenced by this paper.
Showing 1-8 of 8 references

Complexity Classifications of Boolean Constraint Satisfaction Problems

  • N. Creignou, S. Khanna, M. Sudan
  • Monographs on Discrete Applied Mathematics. SIAM
  • 2001
2 Excerpts

The complexity of satisfiability problems

  • T. J. Schaefer
  • Proccedings of the 10th Symposium on Theory of…
  • 1978
2 Excerpts

Boolesche Funktionen und Postsche Klassen

  • S. W. Jablonski, G. P. Gawrilow, W. B. Kudrjawzew
  • volume 6 of Logik und Grundlagen der 10…
  • 1970
1 Excerpt

The two-valued iterative systems of mathematical logic

  • E. L. Post
  • Annals of Mathematical Studies, 5:1–122
  • 1941
1 Excerpt

Similar Papers

Loading similar papers…