APPROX
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
APPROX
2006
Springer
14 years 9 months ago
2006
Springer
APPROX
2006
Springer
14 years 9 months ago
2006
Springer
ANTS
2006
Springer
14 years 9 months ago
2006
Springer
ANTS
2006
Springer
14 years 9 months ago
2006
Springer
ANTS
2006
Springer
14 years 9 months ago
2006
Springer
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
ANTS
2006
Springer
14 years 9 months ago
2006
Springer
We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/((p)(log n)2 ); here (x) is the pri...
ANTS
2006
Springer
14 years 9 months ago
2006
Springer
This paper offers numerical evidence for a conjecture that primality proving may be done in (log N)3+o(1) operations by examining the growth rate of quantities known as pseudosquar...
ANTS
2006
Springer
14 years 9 months ago
2006
Springer
In this report I sanitise (in the sense of `bring some sanity to') the arguments of earlier reports detailing the correspondence between sequences (M +hS)-<h< of divisor...
ANTS
2006
Springer
14 years 9 months ago
2006
Springer