A SIGNED BINARY MULTIPLICATION TECHNIQUE
Clicks: 62
ID: 294969
1951
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Star Article
18.3
/100
62 views
6 readers
AI Quality Assessment
Not analyzed
Readership in this journal
StarRanked #4 of 5 articles by views in The Quarterly Journal of Mechanics and Applied Mathematics
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
A technique is described whereby binary numbers of either sign may be multiplied together by a uniform process which is independent of any foreknowledge of the signs of these numbers.
| Reference Key |
openalex_W2026445983
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | A. D. Booth |
| Journal | The Quarterly Journal of Mechanics and Applied Mathematics |
| Year | 1951 |
| DOI |
10.1093/qjmam/4.2.236
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.