358 search results - page 5 / 72 » GCD of Many Integers |
COMBINATORICS
2004
13 years 7 months ago
2004
A positive list (list of positive integers) is protographic if its merger with all but finitely many positive graphic lists is graphic. Define the family Ps of s-protogaphic lists...
ISTCS
1995
Springer
13 years 11 months ago
1995
Springer
We call a vector x 2 IRn highly regular if it satis es < x m >= 0 for some short, non{zero integer vector m where < : : > is the inner product. We present an algorithm...
CPAIOR
2005
Springer
14 years 1 months ago
2005
Springer
Creating good integer programming formulations had, as a basic axiom, the rule “Find formulations with tighter linear relaxations”. This rule, while useful when using unsophist...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Integer factorization is a very hard computational problem. Currently no ecient algorithm for integer factorization is publicly known. However, this is an important probl...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Arithmetic constraints on integer intervals are supported in many constraint programming systems. We study here a number of approaches to implement constraint propagation for thes...