Linear codes are hard for oblivious read-once parity branching programs (Q1606909)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear codes are hard for oblivious read-once parity branching programs |
scientific article; zbMATH DE number 1771651
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear codes are hard for oblivious read-once parity branching programs |
scientific article; zbMATH DE number 1771651 |
Statements
Linear codes are hard for oblivious read-once parity branching programs (English)
0 references
25 July 2002
0 references
parity OBDDs
0 references
