A Gröbner free alternative for polynomial system solving
M Giusti, G Lecerf, B Salvy - Journal of complexity, 2001 - Elsevier
Given a system of polynomial equations and inequations with coefficients in the field of
rational numbers, we show how to compute a geometric resolution of the set of common …
rational numbers, we show how to compute a geometric resolution of the set of common …
Straight-line programs in geometric elimination theory
M Giusti, J Heintz, JE Morais, J Morgenstem… - Journal of pure and …, 1998 - Elsevier
We present a new method for solving symbolically zero-dimensional polynomial equation
systems in the affine and toric case. The main feature of our method is the use of problem …
systems in the affine and toric case. The main feature of our method is the use of problem …
[書籍][B] Solving polynomial equations
A Dickenstein - 2005 - Springer
The subject of this book is the solution of polynomial equations, that is, systems of
(generally) non-linear algebraic equations. This study is at the heart of several areas of …
(generally) non-linear algebraic equations. This study is at the heart of several areas of …
Sharp estimates for the arithmetic Nullstellensatz
We present sharp estimates for the degree and the height of the polynomials in the
Nullstellensatz over the integer ring ℤ. The result improves previous work of P. Philippon, C …
Nullstellensatz over the integer ring ℤ. The result improves previous work of P. Philippon, C …
Lower bounds for Diophantine approximations
M Giusti, J Heintz, K Hägele, JE Morais… - Journal of Pure and …, 1997 - Elsevier
We introduce a subexponential algorithm for geometric solving of multivariate polynomial
equation systems whose bit complexity depends mainly on intrinsic geometric invariants of …
equation systems whose bit complexity depends mainly on intrinsic geometric invariants of …
When polynomial equation systems can be “solved” fast?
We present a new method for solving symbolically zero-dimensional polynomial equation
systems in the affine and toric case. The main feature of our method is the use of an …
systems in the affine and toric case. The main feature of our method is the use of an …
Polar varieties, real equation solving and data-structures: the hypersurface case
B Bank, M Giusti, J Heintz, GM Mbakop - arxiv preprint alg-geom/9609004, 1996 - arxiv.org
In this paper we apply for the first time a new method for multivariate equation solving which
was developed in\cite {gh1},\cite {gh2},\cite {gh3} for complex root determination to the {\em …
was developed in\cite {gh1},\cite {gh2},\cite {gh3} for complex root determination to the {\em …
Some complexity results for polynomial ideals
EW Mayr - Journal of complexity, 1997 - Elsevier
In this paper, we survey some of our new results on the complexity of a number of problems
related to polynomial ideals. We consider multivariate polynomials over some ring, like the …
related to polynomial ideals. We consider multivariate polynomials over some ring, like the …
Rational invariants of a group action. Construction and rewriting
Geometric constructions applied to a rational action of an algebraic group lead to a new
algorithm for computing rational invariants. A finite generating set of invariants appears as …
algorithm for computing rational invariants. A finite generating set of invariants appears as …