The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The Area-Time Complexity of Binary Multiplication
Open accessAbstract
The problem of performing multtphcaUon of n-bit binary numbers on a chip is considered Let A denote the ch~p area and T the time reqmred to perform mult~phcation.By using a model of computation which is a realistic approx~mauon to current and anucipated LSI or VLSI technology, ~t is shown thatfor all a ~ [0, 1], where A0 and To are posmve constants which depend on the technology but are mdependent of n.The exponent 1 + a is the best possible A consequence of this result is that binary multiphcatlon is "harder" than binary addmon More precisely, ff(AT2~)M(n) and (AT2~)A(n) denote the mmimum area-time complexity for n-b~t binary multiphcauon and addmon, respectively, then (AT2~)M(n) _ 1 f~(nl-a) for 0 _< a --< na for ~ ,(= fi(nl/2) for all a _> 0).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Schnelle Multiplikation großer Zahlen
Schönhage, A., & Strassen, V. (1971) · Computing · doi:10.1007/bf02242355 · Cited by 1,107
Cited by
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
A Regular Layout for Parallel Adders
Brent, & Kung (1982) · IEEE Transactions on Computers · doi:10.1109/tc.1982.1675982 · Cited by 1,147
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413 · Cited by 395
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413-upd1 · Cited by 301
Smaller Decoding Exponents: Ball-Collision Decoding
Bernstein, D. J., Lange, T., & Peters, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_42 · Cited by 191
Metadata
- Authors
- Brent, R. P., & Kung, H. T.
- Venue
- Journal of the ACM
- Published
- 1981-07
- Volume
- 28
- Issue
- 3
- Pages
- 521-534
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2165495918
- Cited by
- 196
- References
- 1
- FWCI
- 23.87
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Area-Time Complexity of Binary Multiplication. https://app.cochat.ai/papers/10.1145/322261.322269
- The paper
- Brent, R. P., & Kung, H. T. (1981). The Area-Time Complexity of Binary Multiplication. Journal of the ACM. https://doi.org/10.1145/322261.322269
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.