scientific article; zbMATH DE number 1775455
From MaRDI portal
Publication:4542589
Recommendations
- A note on read-$k$ times branching programs
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs
- On lower bounds for read-\(k\)-times branching programs
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs
- A hierarchy result for read-once branching programs with restricted parity nondeterminism
- scientific article; zbMATH DE number 1759451
- Satisfiability algorithm for syntactic read-\(k\)-times branching programs
- Satisfiability algorithm for syntactic read-\(k\)-times branching programs
- Comparing the sizes of nondeterministic branching read-k-times programs
- A lower bound for read-once-only branching programs
Cited in
(17)- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
- Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs
- Approximation of boolean functions by combinatorial rectangles
- scientific article; zbMATH DE number 1361505 (Why is no real title available?)
- Notes on Boolean read-\(k\) and multilinear circuits
- Satisfiability algorithm for syntactic read-\(k\)-times branching programs
- The hardest halfspace
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs
- Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
- On the hierarchy of nondeterministic branching k-programs
- Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance
- scientific article; zbMATH DE number 2079872 (Why is no real title available?)
- Classical and Quantum Computations with Restricted Memory
- Satisfiability algorithm for syntactic read-\(k\)-times branching programs
- Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice
- Satisfiable Tseitin formulas are hard for nondeterministic read-once branching programs
- Time-space tradeoffs for branching programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542589)
