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

From MaRDI portal
Revision as of 19:00, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article; zbMATH DE number 6258126
Language Label Description Also known as
English
The expressibility of functions on the boolean domain, with applications to counting CSPs
scientific article; zbMATH DE number 6258126

    Statements

    The expressibility of functions on the boolean domain, with applications to counting CSPs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 February 2014
    0 references
    approximation algorithms
    0 references
    computational complexity
    0 references
    constraint satisfaction problems
    0 references
    counting problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references