All Fields
Computer Science
Medicine
FAQ
Contact
Sign in
Reduction of summands
Reduction of summands is an algorithm for fast binary multiplication of non-signed binary integers. It is performed in three steps: production of…
(More)
Wikipedia
Create Alert
Topic mentions per year
Topic mentions per year
1971-2008
0
1
2
1971
2008
Related topics
Related topics
4 relations
AND gate
Adder (electronics)
Arithmetic logic unit
Binary number
Related mentions per year
Related mentions per year
1952-2018
1960
1980
2000
2020
Reduction of summands
Adder (electronics)
AND gate
Binary number
Arithmetic logic unit
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
n-REPRESENTATION-FINITE ALGEBRAS AND FRACTIONALLY CALABI-YAU ALGEBRAS
MARTIN HERSCHEND
,
Osamu Iyama
2009
In this short paper, we study n-representation-finite algebras from the viewpoint of fractionally Calabi-Yau algebras. We shall…
(More)
Is this relevant?
2008
2008
A regularization algorithm for matrices of bilinear and sesquilinear forms
Roger A. Horn
2008
Over a field or skew field F with an involution a 7→ ã (possibly the identity involution), each singular square matrix A is…
(More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Rings and categories of modules
Kent R. Fuller
,
Silvana Bazzoni
,
Kent Fuller
,
Robert Colby
,
Ángel Del Río Mateos
2006
s of talks Baer modules over tame hereditary algebras Lidia Angeleri Hügel In 1979, Ringel discovered a striking analogy between…
(More)
Is this relevant?
2006
2006
Representation Dimension as a Relative Homological Invariant of Stable Equivalence
Alex Dugas
2006
Over an Artin algebra Λ many standard concepts from homological algebra can be relativized with respect to a contravariantly…
(More)
Is this relevant?
1971
1971
One some general problems in the theory of partitions , I by
Péter L. Erdös
,
Paul Turán
1971
To the memory of H. Davenport l. In our fourth paper on statistical group theory (see [2]) we needed and proved that "almost all…
(More)
Is this relevant?