358 search results - page 16 / 72 » GCD of Many Integers |
TCS
2002
13 years 7 months ago
2002
We de ne an in nite array A of nonnegative integers based on a linear recurrence, whose second row provides basis elements of an exotic ternary numeration system. Using the numerat...
ISCAS
2011
IEEE
12 years 11 months ago
2011
IEEE
— The last two decades have seen many efficient algorithms and architectures for the design of low-complexity bit-parallel Multiple Constant Multiplications (MCM) operation, tha...
JGT
2007
13 years 7 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
CC
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Several mathematical frameworks for static analysis of programs have been developed in the past decades. Although these tools are quite useful, they have still many limit...
DATE
2003
IEEE
14 years 23 days ago
2003
IEEE
A hardware method for functional unit assignment is presented, based on the principle that a functional unit’s power consumption is approximated by the switching activity of its...