Sciweavers

4 search results - page 1 / 1
» A Numerical Absolute Primality Test for Bivariate Polynomial...
Sort
View
ISSAC
1997
Springer
102views Mathematics» more  ISSAC 1997»
13 years 9 months ago
A Numerical Absolute Primality Test for Bivariate Polynomials
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...
André Galligo, Stephen M. Watt
JSC
2010
90views more  JSC 2010»
13 years 3 months ago
Modular Las Vegas algorithms for polynomial absolute factorization
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,...
Cristina Bertone, Guillaume Chèze, Andr&eac...
CCCG
2008
13 years 6 months ago
Polynomial irreducibility testing through Minkowski summand computation
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] wh...
Deepanjan Kesh, Shashank K. Mehta
ICCV
1999
IEEE
14 years 6 months ago
Camera Pose and Calibration from 4 or 5 Known 3D Points
We describe two direct quasilinear methods for camera pose (absolute orientation) and calibration from a single image of 4 or 5 known 3D points. They generalize the 6 point `Direc...
Bill Triggs