Bases for Boolean co-clones

Information Processing Letters

Volumn 96, Issue 2, 2005, Pages 59-66

  Böhler, Elmar ^a   Reith, Steffen ^b   Schnoor, Henning ^c   Vollmer, Heribert ^c  

^a UNIVERSITY OF WÜRZBURG   (Germany)

^b Lengfelclerstraße 35b   (Germany)

^c LEIBNIZ UNIVERSITY HANNOVER   (Germany)

Author keywords

Boolean constraints; Closure properties; Combinatorial problems; Computational complexity

Indexed keywords

CONSTRAINT THEORY; SET THEORY;

BOOLEAN CO-CLONES; BOOLEAN CONSTRAINTS; UNIVERSAL ALGEBRA;

BOOLEAN ALGEBRA;

EID: 27544431529     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.06.003     Document Type: Article

References (8)

1. E. Allender, M. Bauland, N. Immerman, H. Schnoor, H. Vollmer, The complexity of satisfiability problems: Refining Schaefer's theorem, in: Proceedings of MFCS, 2005. Technical Report 04-100, Electronic Colloquium on Computational Complexity, 2004.
2. E. Böhler, N. Creignou, S. Reith, H. Vollmer, Playing with Boolean blocks, part I: Post's lattice with applications to complexity theory, ACM-SIGACT Newsletter 34 (4) (2003) 38-52.
3. E. Böhler, N. Creignou, S. Reith, H. Vollmer, Playing with Boolean blocks, part II: Constraint satisfaction problems, ACM-SIGACT Newsletter 35 (1) (2004) 22-35.
4. N. Creignou, S. Khanna, M. Sudan, Complexity Classifications of Boolean Constraint Satisfaction Problems, Monogr. Discrete Appl. Math., SIAM, Philadelphia, 2001.
5. S.W. Jablonski, G.P. Gawrilow, W.B. Kudrjawzew, Boolesche Funktionen und Postsche Klassen, Logik und Grundlagen der Mathematik, vol. 6, Friedr. Vieweg & Sohn and C.F. Winter'sche Verlagsbuchhandlung, Braunschweig and Basel, 1970.
6. N. Pippenger, Theories of Computability, Cambridge Univ. Press, Cambridge, UK, 1997.
7. E.L. Post, The two-valued iterative systems of mathematical logic, Ann. Math. Stud. 5 (1941) 1-122.
8. T.J. Schaefer, The complexity of satisfiability problems, in: Proceedings of the 10th Symposium on Theory of Computing, ACM Press, New York, 1978, pp. 216-226.