Linear codes are hard for oblivious read-once parity branching programs
From MaRDI portal
Publication:1606909
DOI10.1016/S0020-0190(99)00027-7zbMath1002.68054OpenAlexW1998989512MaRDI QIDQ1606909
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00027-7
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs ⋮ Lower bounds for restricted read-once parity branching programs ⋮ Lower bounds for linearly transformed OBDDs and FBDDs
Cites Work
- Neither reading few bits twice nor reading illegally helps much
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
- A note on read-$k$ times branching programs
- On the descriptive and algorithmic power of parity ordered binary decision diagrams
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear codes are hard for oblivious read-once parity branching programs
