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

From MaRDI portal
Revision as of 21:36, 23 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Linear codes are hard for oblivious read-once parity branching programs
scientific article

    Statements

    Linear codes are hard for oblivious read-once parity branching programs (English)
    0 references
    0 references
    25 July 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    parity OBDDs
    0 references