CORR
2010
Springer
13 years 3 months ago
2010
Springer
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
CORR
1998
Springer
13 years 4 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
MOC
2000
13 years 4 months ago
2000
Abstract. Complexity theoretic aspects of continuation methods for the solution of square or underdetermined systems of polynomial equations have been studied by various authors. I...
JC
2008
13 years 4 months ago
2008
We show several estimates on the probability distribution of some data at points in real complete intersection varieties: norms of real affine solutions, condition number of real ...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard ove...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
EUROCRYPT
2004
Springer
13 years 10 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...
ASIACRYPT
2004
Springer
13 years 10 months ago
2004
Springer
The “XL-algorithm” is a computational method to solve overdetermined systems of polynomial equations which is based on a generalization of the well-known method of linearizatio...
SMA
2006
ACM
13 years 10 months ago
2006
ACM
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
ADG
2006
Springer
13 years 10 months ago
2006
Springer
This paper describes the recent convergence of four topics: polynomial systems, flexibility of three dimensional objects, computational chemistry, and computer algebra. We discuss...