An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order
From MaRDI portal
(Redirected from Publication:708357)
Recommendations
- Better upper bounds on the QOBDD size of integer multiplication
- On the OBDD complexity of the most significant bit of integer multiplication
- scientific article; zbMATH DE number 1688393
- Bounds on the OBDD-size of integer multiplication via universal hashing
- Larger lower bounds on the OBDD complexity of integer multiplication
Cites work
- A larger lower bound on the OBDD complexity of the most significant bit of multiplication
- A read-once branching program lower bound of \({\omega}(2^{n/4})\) for integer multiplication using universal hashing
- Better upper bounds on the QOBDD size of integer multiplication
- Bounds on the OBDD-size of integer multiplication via universal hashing
- Branching Programs and Binary Decision Diagrams
- New results on the complexity of the middle bit of multiplication
- New results on the most significant bit of integer multiplication
- On the OBDD Complexity of the Most Significant Bit of Integer Multiplication
- Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
Cited in
(2)
This page was built for publication: An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708357)