Boolean max-co-clones (Q494629): Difference between revisions

In this paper, the author studies max-co-clones giving a complete description of Boolean max-co-clones. It is shown that there are infinitely many Boolean max-co-clones and all of them are regular co-clones. Some generating sets of all Boolean max-co-clones are given.

0 references

zbMATH Keywords

max-co-clones

0 references

Boolean max-co-clones

0 references

approximate counting

0 references

reviewed by

Lavinia Corina Ciungu

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00012-015-0336-1

0 references

cites work

An inequality for the weights of two families of sets, their unions and intersections

0 references

Structure identification of Boolean relations and plain bases for co-clones

0 references

Basics of Galois Connections

0 references

The complexity of constraint satisfaction games and QCSP

0 references

Q4432125

0 references

Closed systems of functions and predicates

0 references

The complexity of the counting constraint satisfaction problem

0 references

Q2904771

0 references

The expressibility of functions on the boolean domain, with applications to counting CSPs

0 references

The relative complexity of approximate counting problems

0 references

Q5389338

0 references

Complexity Classifications of Boolean Constraint Satisfaction Problems

0 references

An approximation trichotomy for Boolean \#CSP

0 references

Closure properties of constraints

0 references

Constraint Satisfaction with Counting Quantifiers

0 references

Q3208654

0 references

The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

0 references

The complexity of satisfiability problems

0 references

Identifiers

zbMATH Open document ID

1348.08004

0 references

DOI

10.1007/s00012-015-0336-1

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:494629

@@ Property / review text @@
+In this paper, the author studies max-co-clones giving a complete description of Boolean max-co-clones. It is shown that there are infinitely many Boolean max-co-clones and all of them are regular co-clones. Some generating sets of all Boolean max-co-clones are given.
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+A70
@@ Property / Mathematics Subject Classification ID: 08A70 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+A40
@@ Property / Mathematics Subject Classification ID: 08A40 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B99
@@ Property / Mathematics Subject Classification ID: 06B99 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6477383
@@ Property / zbMATH DE Number: 6477383 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+max-co-clones
@@ Property / zbMATH Keywords: max-co-clones / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Boolean max-co-clones
@@ Property / zbMATH Keywords: Boolean max-co-clones / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximate counting
@@ Property / zbMATH Keywords: approximate counting / rank @@
+Normal rank
@@ Property / reviewed by @@
+Lavinia Corina Ciungu
@@ Property / reviewed by: Lavinia Corina Ciungu / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00012-015-0336-1
+Normal rank
@@ Property / OpenAlex ID @@
+W855026756
@@ Property / OpenAlex ID: W855026756 / rank @@
+Normal rank
@@ Property / cites work @@
+An inequality for the weights of two families of sets, their unions and intersections
+Normal rank
@@ Property / cites work @@
+Structure identification of Boolean relations and plain bases for co-clones
+Normal rank
@@ Property / cites work @@
+Basics of Galois Connections
@@ Property / cites work: Basics of Galois Connections / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of constraint satisfaction games and QCSP
+Normal rank
@@ Property / cites work @@
+Q4432125
@@ Property / cites work: Q4432125 / rank @@
+Normal rank
@@ Property / cites work @@
+Closed systems of functions and predicates
@@ Property / cites work: Closed systems of functions and predicates / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the counting constraint satisfaction problem
+Normal rank
@@ Property / cites work @@
+Q2904771
@@ Property / cites work: Q2904771 / rank @@
+Normal rank
@@ Property / cites work @@
+The expressibility of functions on the boolean domain, with applications to counting CSPs
+Normal rank
@@ Property / cites work @@
+The relative complexity of approximate counting problems
+Normal rank
@@ Property / cites work @@
+Q5389338
@@ Property / cites work: Q5389338 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Classifications of Boolean Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+An approximation trichotomy for Boolean \#CSP
@@ Property / cites work: An approximation trichotomy for Boolean \#CSP / rank @@
+Normal rank
@@ Property / cites work @@
+Closure properties of constraints
@@ Property / cites work: Closure properties of constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint Satisfaction with Counting Quantifiers
@@ Property / cites work: Constraint Satisfaction with Counting Quantifiers / rank @@
+Normal rank
@@ Property / cites work @@
+Q3208654
@@ Property / cites work: Q3208654 / rank @@
+Normal rank
@@ Property / cites work @@
+The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:494629