Boolean max-co-clones
From MaRDI portal
Publication:494629
DOI10.1007/S00012-015-0336-1zbMATH Open1348.08004OpenAlexW855026756MaRDI QIDQ494629FDOQ494629
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
Recommendations
Operations and polynomials in algebraic structures, primal algebras (08A40) Applications of universal algebra in computer science (08A70) Lattices (06B99)
Cites Work
- The relative complexity of approximate counting problems
- Complexity classifications of Boolean constraint satisfaction problems
- Title not available (Why is that?)
- Closure properties of constraints
- The complexity of the counting constraint satisfaction problem
- The complexity of satisfiability problems
- The expressibility of functions on the Boolean domain, with applications to counting CSPs
- An approximation trichotomy for Boolean \#CSP
- Closed systems of functions and predicates
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- Structure identification of Boolean relations and plain bases for co-clones
- An inequality for the weights of two families of sets, their unions and intersections
- The complexity of constraint satisfaction games and QCSP
- Basics of Galois Connections
- Log-supermodular functions, functional clones and counting CSPs
- Constraint satisfaction with counting quantifiers
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
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)