The multiplicative complexity of quadratic boolean forms (Q1199694): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Boolean function requiring 3n network size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Evaluation of Pairs of Bilinear Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Bilinear Forms with Commutativity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiplicative complexity of quadratic boolean forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4724549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3n-lower bound on the network complexity of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gödel Theorem on Network Complexity Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4047029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221885 / rank
 
Normal rank

Latest revision as of 16:21, 16 May 2024

scientific article
Language Label Description Also known as
English
The multiplicative complexity of quadratic boolean forms
scientific article

    Statements

    The multiplicative complexity of quadratic boolean forms (English)
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    multiplicative complexity
    0 references
    quadratic Boolean forms
    0 references
    0 references