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.
2018
2018
In this work, we propose a class of importance sampling (IS) estimators for estimating the right tail probability of a sum of… 
2014
2014
It is well known that the Einstein equation on a Riemannian flag manifold $(G/K,g)$ reduces to a algebraic system, if $g$ is a $G… 
2011
2011
For any positive integer n and any fixed integer k1,M.Bencze defined two Smarandache Summands functions S(n,k) and AS(n,k).Then… 
2010
2010
Let n,k1 are two positive integers.m≥0 is another fixed integer.The general Smarandache Summands function S(n,m,k) is defined by… 
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… 
2000
2000
Multidimensional Heisenberg algebras, whose creation a+ and annihilation a operators are the n-dimensional vectors, can be…