A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf
.
Probabilistic algorithms for polynomial absolute factorization
2010
ACM SIGSAM Bulletin
We show a fast algorithm to find a rational number in a given real interval whose denominator is minimal. The algorithm is similar to the regular continued fraction expansion for a real number. Abstract We provide a method of determining whether there exist some p ∈ P and f ∈ F such that p is divisible by f for a pair of real multivariate interval polynomials, P and F . Although this problem is written as a feasibility problem for a system of nonlinear algebraic equations, it is an NP-hard
doi:10.1145/1823931.1823936
fatcat:paopikhxnzao7ez5vjkcp6gi3y