Sciweavers

778 search results - page 16 / 156
» Bounding Smooth Integers
Sort
View
WCC
2005
Springer
117views Cryptology» more  WCC 2005»
14 years 1 months ago
Interpolation of Functions Related to the Integer Factoring Problem
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
Clemens Adelmann, Arne Winterhof
MP
2007
100views more  MP 2007»
13 years 7 months ago
Mixed-Integer Cuts from Cyclic Groups
We analyze a separation procedure for Mixed-Integer Programs related to the work of Gomory and Johnson on interpolated subadditive functions. This approach has its roots in the Go...
Matteo Fischetti, Cristiano Saturni
CADE
2012
Springer
11 years 10 months ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...
MP
2007
142views more  MP 2007»
13 years 7 months ago
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branc...
Jagat Patel, John W. Chinneck
ARITH
2011
IEEE
12 years 7 months ago
Short Division of Long Integers
—We consider the problem of short division — i.e., approximate quotient — of multiple-precision integers. We present ready-to-implement algorithms that yield an approximation...
David Harvey, Paul Zimmermann