scientific article; zbMATH DE number 1759409
From MaRDI portal
Publication:4536358
Recommendations
- Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
- A Lower Bound for Integer Multiplication with Read-Once Branching Programs
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
- A read-once branching program lower bound of \({\omega}(2^{n/4})\) for integer multiplication using universal hashing
- A lower bound for integer multiplication on randomized ordered read-once branching programs.
Cited in
(14)- The power of nondeterminism in polynomial-size bounded-width branching programs
- A lower bound for integer multiplication on randomized ordered read-once branching programs.
- Expanders and time-restricted branching programs
- New results on the complexity of the middle bit of multiplication
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
- A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications
- Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
- On the complexity of randomized read-once branching programs
- Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
- A Lower Bound for Integer Multiplication with Read-Once Branching Programs
- scientific article; zbMATH DE number 1263188 (Why is no real title available?)
- Lower bounds for nondeterministic semantic read-once branching programs
- scientific article; zbMATH DE number 1929932 (Why is no real title available?)
- A read-once branching program lower bound of \({\omega}(2^{n/4})\) for integer multiplication using universal hashing
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 Q4536358)
