On length of Boolean functions of a small number of variables in the class of pseudo-polynomials (Q2215245): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity lower bound for Boolean functions in the class of extended operator forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for complexity of polynomial normal forms of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Boolean functions in the class of polarized polynomial forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity of a particular Boolean functions class / rank
 
Normal rank

Latest revision as of 04:03, 24 July 2024

scientific article
Language Label Description Also known as
English
On length of Boolean functions of a small number of variables in the class of pseudo-polynomials
scientific article

    Statements

    On length of Boolean functions of a small number of variables in the class of pseudo-polynomials (English)
    0 references
    11 December 2020
    0 references
    Boolean function
    0 references
    Zhegalkin polynomial
    0 references
    EXOR sum of pseudo-products (ESPP)
    0 references
    pseudo-polynomial form
    0 references
    PSPF
    0 references
    classification by length
    0 references

    Identifiers