Sciweavers

237 search results - page 21 / 48
» MapReduce for Integer Factorization
Sort
View
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 11 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas
ACIVS
2006
Springer
14 years 4 months ago
Greyscale Image Interpolation Using Mathematical Morphology
When magnifying a bitmapped image, we want to increase the number of pixels it covers, allowing for finer details in the image, which are not visible in the original image. Simple...
Alessandro Ledda, Hiêp Quang Luong, Wilfried...
DM
2010
102views more  DM 2010»
13 years 11 months ago
Covering graphs with matchings of fixed size
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
David Cariolaro, Hung-Lin Fu
SIAMCOMP
2000
76views more  SIAMCOMP 2000»
13 years 10 months ago
On Interpolation and Automatization for Frege Systems
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
Maria Luisa Bonet, Toniann Pitassi, Ran Raz
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
14 years 11 months ago
Fast quantum algorithms for computing the unit group and class group of a number field
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
Sean Hallgren