|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
25th Annual Symposium on Foundations of Computer Science (FOCS 1984)
Singer Island, FL
October 24-October 26
ISBN: 0-8186-0591-X
| ASCII Text | x | ||
| P.W. Beame, S.A. Cook, H.J. Hoover, "Log Depth Circuits For Division And Related Problems," Foundations of Computer Science, IEEE Annual Symposium on, pp. 1-6, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1984.715894, author = {P.W. Beame and S.A. Cook and H.J. Hoover}, title = {Log Depth Circuits For Division And Related Problems}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1984}, isbn = {0-8186-0591-X}, pages = {1-6}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1984.715894}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Log Depth Circuits For Division And Related Problems SN - 0-8186-0591-X SP1 EP6 A1 - P.W. Beame, A1 - S.A. Cook, A1 - H.J. Hoover, PY - 1984 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
We present optimal depth Boolean circuits (depth O(log n)) for integer division, powering, and multiple products. We also show that these three problems are of equivalent uniform depth and space complexity. In addition, we describe an algorithm for testing divisibility that is optimal for both depth and space.
Citation:
P.W. Beame, S.A. Cook, H.J. Hoover, "Log Depth Circuits For Division And Related Problems," focs, pp.1-6, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984
Usage of this product signifies your acceptance of the Terms of Use.