Linear codes are hard for oblivious read-once parity branching programs (Q1606909)

From MaRDI portal
Revision as of 03:57, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Linear codes are hard for oblivious read-once parity branching programs
scientific article

    Statements

    title
    Linear codes are hard for oblivious read-once parity branching programs (English)
    0 references
    author
    Stasys P. Jukna
    0 references
    publication date
    25 July 2002
    0 references
    Mathematics Subject Classification ID
    68Q05
    0 references
    94B05
    0 references
    68Q17
    0 references
    zbMATH DE Number
    1771651
    0 references
    zbMATH Keywords
    parity OBDDs
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1606909&oldid=13907969"
    Powered by MediaWiki