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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q344088
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Lavinia Corina Ciungu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00012-015-0336-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W855026756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for the weights of two families of sets, their unions and intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure identification of Boolean relations and plain bases for co-clones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basics of Galois Connections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of constraint satisfaction games and QCSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed systems of functions and predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the counting constraint satisfaction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressibility of functions on the boolean domain, with applications to counting CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative complexity of approximate counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5389338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation trichotomy for Boolean \#CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction with Counting Quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank

Latest revision as of 17:43, 10 July 2024

scientific article
Language Label Description Also known as
English
Boolean max-co-clones
scientific article

    Statements

    Boolean max-co-clones (English)
    0 references
    0 references
    1 September 2015
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    max-co-clones
    0 references
    Boolean max-co-clones
    0 references
    approximate counting
    0 references
    0 references