Circuit complexity of linear functions: gate elimination and feeble security (Q1946842)

From MaRDI portal
Revision as of 23:21, 26 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57100982, #quickstatements; #temporary_batch_1711486624475)
scientific article
Language Label Description Also known as
English
Circuit complexity of linear functions: gate elimination and feeble security
scientific article

    Statements

    title
    Circuit complexity of linear functions: gate elimination and feeble security (English)
    0 references
    author
    A. P. Davydow
    0 references
    Sergey I. Nikolenko
    0 references
    publication date
    9 April 2013
    0 references
    zbMATH Keywords
    feeble security
    0 references
    circuit complexity
    0 references
    linear function
    0 references
    linear Boolean functions
    0 references

    Identifiers

    zbMATH DE Number
    6152344
    0 references
    OpenAlex ID
    W2006196719
    0 references
    Wikidata QID
    Q57100982
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1946842&oldid=33205371"
    Powered by MediaWiki