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 …

[書籍][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 …

Sharp estimates for the arithmetic Nullstellensatz

T Krick, LM Pardo, M Sombra - 2001 - projecteuclid.org
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 …

Polar varieties and computation of one point in each connected component of a smooth real algebraic set

M Safey El Din, E Schost - … of the 2003 international symposium on …, 2003 - dl.acm.org
Let f1, ldots, fs be polynomials in Q [X1,..., Xn] that generate a radical ideal and let V be their
complex zero-set. Suppose that V is smooth and equidimensional; then we show that …

[書籍][B] Finite Fields: Theory and Computation: The meeting point of number theory, computer science, coding theory and cryptography

I Shparlinski - 2013 - books.google.com
This book is mainly devoted to some computational and algorithmic problems in finite fields
such as, for example, polynomial factorization, finding irreducible and primitive polynomials …

Computing parametric geometric resolutions

É Schost - Applicable Algebra in Engineering, Communication …, 2003 - Springer
Given a polynomial system of n equations in n unknowns that depends on some parameters,
we define the notion of parametric geometric resolution as a means to represent some …

Polar varieties and efficient real elimination

B Bank, M Giusti, J Heintz, GM Mbakop - Mathematische Zeitschrift, 2001 - Springer
Let S_0 be a smooth and compact real variety given by a reduced regular sequence of
polynomials f_1,...,f_p. This paper is devoted to the algorithmic problem of finding efficiently …

[HTML][HTML] Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers

G Lecerf - Journal of Complexity, 2003 - Elsevier
We present a new probabilistic method for solving systems of polynomial equations and
inequations. Our algorithm computes the equidimensional decomposition of the Zariski …

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 …

Sharp estimates for triangular sets

X Dahan, É Schost - Proceedings of the 2004 international symposium …, 2004 - dl.acm.org
We study the triangular representation of zero-dimensional varieties defined over the
rational field (resp. a rational function field). We prove polynomial bounds in terms of intrinsic …