Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q89966425, #quickstatements; #temporary_batch_1707252663060
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: René Peralta / rank
Normal rank
 
Property / author
 
Property / author: René Peralta / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Circuits / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2968960252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3775483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4246565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal 4-bit Reversible Mixed-Polarity Toffoli Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds to Complexities of Networks for Sorting and for Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Garbled Circuit: Free XOR Gates and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Leveled) fully homomorphic encryption without bootstrapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short non-interactive cryptographic proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-Order Masking Schemes for S-Boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Computing Two Nonlinearity Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of Boolean functions with multiplicative complexity 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiplicative Complexity of Boolean Functions on Four and Five Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiplicative complexity of 6-variable Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for the multiplicative complexity of symmetric functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832047 / rank
 
Normal rank

Latest revision as of 15:46, 22 July 2024

scientific article
Language Label Description Also known as
English
Upper bounds on the multiplicative complexity of symmetric Boolean functions
scientific article

    Statements

    Upper bounds on the multiplicative complexity of symmetric Boolean functions (English)
    0 references
    0 references
    0 references
    0 references
    12 May 2020
    0 references
    symmetric Boolean functions
    0 references
    multiplicative complexity
    0 references
    upper bounds
    0 references
    logic minimization
    0 references
    0 references
    0 references

    Identifiers