Linear codes are hard for oblivious read-once parity branching programs (Q1606909): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:57, 1 February 2024
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
25 July 2002
0 references
parity OBDDs
0 references
