778 search results - page 10 / 156 » Bounding Smooth Integers |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
In this paper we study approximation algorithms for solving a general covering integer program. An
STOC
1989
ACM
13 years 11 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...
DCG
2010
13 years 7 months ago
2010
We study discrete curvatures computed from nets of curvature lines on a given smooth surface and prove their uniform convergence to smooth principal curvatures. We provide explicit...
MOC
1998
13 years 7 months ago
1998
We give bounds for the coefficients of a polynomial as functions of the diameter of its roots, hence we obtain polynomials with minimal diameters and small degree
CPM
2010
Springer
14 years 10 days ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...