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

From MaRDI portal
scientific article
Language Label Description Also known as
English
Circuit complexity of linear functions: gate elimination and feeble security
scientific article

    Statements

    Circuit complexity of linear functions: gate elimination and feeble security (English)
    0 references
    0 references
    0 references
    9 April 2013
    0 references
    0 references
    feeble security
    0 references
    circuit complexity
    0 references
    linear function
    0 references
    linear Boolean functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references