Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts (Q344027): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Complexity of Boolean functions in the class of canonical polarized polynomials / 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: An upper bound for complexity of polynomial normal forms of Boolean functions / 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: Asymmetric binary covering codes. / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3103/s0278641916030043 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4238995141 / rank
 
Normal rank

Latest revision as of 09:36, 30 July 2024

scientific article
Language Label Description Also known as
English
Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
scientific article

    Statements

    Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts (English)
    0 references
    22 November 2016
    0 references
    Boolean function
    0 references
    polynomial form
    0 references
    Zhegalkin polynomial
    0 references
    exclusive-OR sum of pseudoproducts
    0 references
    length
    0 references
    upper bound
    0 references
    multiaffine function
    0 references

    Identifiers