861 search results - page 35 / 173 » Faster integer multiplication |
ALGORITHMICA
2006
15 years 2 months ago
2006
Abstract. An overpartition of an integer n is a partition where the last occurrence of a part can be overlined. We study the weight of the overlined parts of an overpartition count...
104
Voted
CIE
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
148
click to vote
IPCO
2008
15 years 3 months ago
2008
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cu...
109
click to vote
DAM
2008
15 years 2 months ago
2008
We study the combinatorial problem of finding an arrangement of distinct integers into the ddimensional N-cube so that the maximal variance of the numbers on each -dimensional sec...
CORR
2007
Springer
15 years 2 months ago
2007
Springer
— A novel fast recursive coding technique is proposed. It operates with only integer values not longer 8 bits and is multiplication free. Recursion the algorithm is based on indi...