Tight bounds for the multiplicative complexity of symmetric functions (Q924152): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2008.01.030 / rank
Normal rank
 
Property / author
 
Property / author: Joan. Boyar / rank
Normal rank
 
Property / author
 
Property / author: Joan. Boyar / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62472218 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007233204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum disclosure proofs of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short non-interactive cryptographic proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete logarithm implementation of perfect zero-knowledge blobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the communication complexity of zero-knowledge proofs / 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: Q3149671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206314 / 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: Q3316588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinational complexity of certain symmetric Boolean functions / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2008.01.030 / rank
 
Normal rank

Latest revision as of 08:15, 10 December 2024

scientific article
Language Label Description Also known as
English
Tight bounds for the multiplicative complexity of symmetric functions
scientific article

    Statements

    Tight bounds for the multiplicative complexity of symmetric functions (English)
    0 references
    0 references
    0 references
    28 May 2008
    0 references
    circuit complexity
    0 references
    multiplicative complexity
    0 references
    symmetric functions
    0 references
    multi-party computation
    0 references
    cryptographic proofs
    0 references

    Identifiers

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