scientific article; zbMATH DE number 4131661
From MaRDI portal
Publication:3033322
Recommendations
- Bounds for parallel addition time of two numbers
- Some notes on threshold circuits, and multiplication in depth 4
- scientific article; zbMATH DE number 3852437
- Tight bounds on expected time to add correctly and add mostly correctly
- Addition is exponentially harder than counting for shallow monotone circuits
Cited in
(9)- Tight bounds on expected time to add correctly and add mostly correctly
- Parallel addition time for several numbers
- Sharpening an upper bound on the adder and comparator depths
- Parallel Binary Adders with a Minimum Number of Connections
- scientific article; zbMATH DE number 3873237 (Why is no real title available?)
- scientific article; zbMATH DE number 3934407 (Why is no real title available?)
- Binary adder circuits of asymptotically minimum depth, linear size, and fan-out two
- On the problem of computational time and complexity of arithmetic functions
- Bounds for parallel addition time of two numbers
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 Q3033322)
