149 search results - page 1 / 30 » Solving Very Sparse Rational Systems of Equations |
TOMS
2011
13 years 1 months ago
2011
JSC
2008
13 years 6 months ago
2008
We describe algorithms for solving a given system of multivariate polynomial equations via the Rational Univariate Reduction (RUR). We compute the RUR from the toric resultant of ...
DCC
2008
IEEE
14 years 5 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
CORR
1998
Springer
13 years 5 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...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a p-adic lifting technique combined with the use of block matr...