778 search results - page 28 / 156 » Bounding Smooth Integers |
103
click to vote
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
113
click to vote
ENDM
2007
15 years 3 months ago
2007
For a given positive integer k, sr(m, k) denotes the minimal positive integer such that every coloring of [n], n ≥ sr(m, k), that uses each color at most k times, yields a rainb...
156
click to vote
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
15 years 7 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
136
click to vote
MOC
2010
14 years 10 months ago
2010
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...
CPC
2008
15 years 3 months ago
2008
A set of integers A is called a B2[g] set if every integer m has at most g representations of the form m = a + a , with a a and a, a A. We obtain a new lower bound for F(g, n), t...