10 search results - page 2 / 2 » New recombination algorithms for bivariate polynomial factor... |
ISSAC
1997
Springer
13 years 10 months ago
1997
Springer
We give a new numerical absolute primality criterion for bivariate polynomials. This test is based on a simple property of the monomials appearing after a generic linear change of...
CRYPTO
2007
Springer
13 years 12 months ago
2007
Springer
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
EUROCRYPT
2004
Springer
13 years 11 months ago
2004
Springer
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
JSC
2010
13 years 4 months ago
2010
Let f(X, Y ) ∈ Z[X, Y ] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f, or more precisely,...
ICCV
2011
IEEE
12 years 5 months ago
2011
IEEE
We present a new Coprime Blurred Pair (CBP) theory that may benefit a number of computer vision applications. A CBP is constructed by blurring the same latent image with two unkn...