DAM
2011
13 years 6 months ago
2011
The \Cross Product" technique introduced by Even and Litman EL92] is extended into a fulldecompositiontheory enablinga unique (up to isomorphism)and polynomialfactorizationof...
DM
2007
13 years 11 months ago
2007
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...
GI
2007
Springer
14 years 5 months ago
2007
Springer
: We study the factoring with known bits problem, where we are given a composite integer N = p1p2 . . . pr and oracle access to the bits of the prime factors pi, i = 1, . . . , r. ...