Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Andrews, Lewis and Lovejoy introduced a new class of partitions, partitions with designated summands. Let PD(n) denote the number… 
2012
2012
We construct the homogeneous Einstein equation for generalized flag manifolds G/K of a compact simple Lie group G whose isotropy… 
2010
2010
We give a complete classification of the infinite dimensional tilting modules over a tame hereditary algebra R. We start our… 
2010
2010
The calculating problem of one kind Dirichlet series involving the function S(n,k) is studied.By using the properties of Gauss… 
2006
2006
We provide a new algorithm for indenite nested summation which is applicable to summands involving unspecied sequences x(n). More… 
2006
2006
s of talks Baer modules over tame hereditary algebras Lidia Angeleri Hügel In 1979, Ringel discovered a striking analogy between… 
1996
1996
  • V. Lev
  • 1996
  • Corpus ID: 206792826
We solve an arithmetic problem due to Erdös and Freud (1986) investigated also by Freiman, Nathanson and Sárközy: How many… 
Highly Cited
1993
Highly Cited
1993
This paper, the second in a series of three papers, studying the use of relative homological algebra in the representation theory…