A new algorithm for the geometric decomposition of a variety

Authors:
Mohamed Elkadi;Bernard Mourrain
Affiliations:
UNSA, UMR 6621, Part Valrose, B.P. 71, 06108 Nice Ccdex02, France;INRIA, SAGA, 2004 route des Lucioles, B.P. 93, 06902 Sophia Antipolis, France
Venue:
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Year:
1999

Citing 12
Cited 8

Basic principles of mechanical theorem proving in elementary geometrics

Journal of Automated Reasoning
Gröbner bases and primary decomposition of polynomial ideals

Journal of Symbolic Computation
Generalised characteristic polynomials

Journal of Symbolic Computation - Special issue on computational algebraic complexity
A new method for solving algebraic systems of positive dimension

Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
On the computational complexity and geometry of the first-order theory of the reals. Par I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals

Journal of Symbolic Computation
Gro¨bner bases: a computational approach to commutative algebra

Gro¨bner bases: a computational approach to commutative algebra
A generalized Euclidean algorithm for computing triangular representations of algebraic varieties

Journal of Symbolic Computation
Zeros, multiplicities, and idempotents for zero-dimensional systems

Algorithms in algebraic geometry and applications
Multivariate Bezoutians, Kronecker symbol and Eisenbud-Levine formula

Algorithms in algebraic geometry and applications
A computational method for diophantine approximation

Algorithms in algebraic geometry and applications
Computational methods in commutative algebra and algebraic geometry

Computational methods in commutative algebra and algebraic geometry
Computing the isolated roots by matrix methods

Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials

Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers

Journal of Complexity
A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals

Computer Mathematics
Bezoutian and quotient ring structure

Journal of Symbolic Computation
On computing absolutely irreducible components of algebraic varieties with parameters

Computing
Sparse differential resultant

Proceedings of the 36th international symposium on Symbolic and algebraic computation
On the computation of matrices of traces and radicals of ideals

Journal of Symbolic Computation
Affine solution sets of sparse polynomial systems

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

A new algorithm for the geometric decomposition of a variety

Quantified Score

Visualization

Abstract