A nondeterministic space-time tradeoff for linear codes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5899238
- Time-space tradeoffs for branching programs
- scientific article; zbMATH DE number 1746571
- A lower bound for the computational complexity of characteristic functions of BCH-codes by branching programs
- Neither reading few bits twice nor reading illegally helps much
Cites work
- scientific article; zbMATH DE number 5899238 (Why is no real title available?)
- scientific article; zbMATH DE number 4218008 (Why is no real title available?)
- scientific article; zbMATH DE number 3257409 (Why is no real title available?)
- A lower bound on branching programs reading some bits twice
- A note on read-$k$ times branching programs
- Branching Programs and Binary Decision Diagrams
- Determinism versus nondeterminism for linear time RAMs with memory restrictions
- Expanders and time-restricted branching programs
- Neither reading few bits twice nor reading illegally helps much
- On lower bounds for read-\(k\)-times branching programs
- Time-space trade-off lower bounds for randomized computation of decision problems
- Time-space tradeoffs for branching programs
Cited in
(4)
This page was built for publication: A nondeterministic space-time tradeoff for linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976097)