Boolean max-co-clones

DOI10.1007/S00012-015-0336-1MaRDI QIDQ494629zbMATH OpenOpenAlexFDO

Authors Andrei A. Bulatov

Publication date 1 September 2015

Published in Algebra Universalis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00012-015-0336-1

zbMATH Keywords

approximate countingBoolean max-co-clonesmax-co-clones

Mathematics Subject Classification ID

Operations and polynomials in algebraic structures, primal algebras (08A40) Applications of universal algebra in computer science (08A70) Lattices (06B99)

Recommendations

• Publication:3470521
• Bases for Boolean co-clones
• scientific article; zbMATH DE number 1134609
• scientific article; zbMATH DE number 32737
• All maximal clones of a majority ordered set

Cites work

• scientific article; zbMATH DE number 3650557 (Why is no real title available?)
• scientific article; zbMATH DE number 1992703 (Why is no real title available?)
• scientific article; zbMATH DE number 6028114 (Why is no real title available?)
• An approximation trichotomy for Boolean \#CSP
• An inequality for the weights of two families of sets, their unions and intersections
• Basics of Galois Connections
• Closed systems of functions and predicates
• Closure properties of constraints
• Complexity classifications of Boolean constraint satisfaction problems
• Constraint satisfaction with counting quantifiers
• Log-supermodular functions, functional clones and counting CSPs
• Structure identification of Boolean relations and plain bases for co-clones
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• The complexity of constraint satisfaction games and QCSP
• The complexity of satisfiability problems
• The complexity of the counting constraint satisfaction problem
• The expressibility of functions on the Boolean domain, with applications to counting CSPs
• The relative complexity of approximate counting problems

Cited in

(3)

• Bases for Boolean co-clones
• Structure identification of Boolean relations and plain bases for co-clones
• Counting constraint satisfaction problems

This page was built for publication: Boolean max-co-clones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494629)