A new algorithm for the geometric decomposition of a variety
Authors:
Open Access
- 1 July 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 9-16
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Computing the Isolated Roots by Matrix MethodsJournal of Symbolic Computation, 1998
- A computational method for diophantine approximation1996
- Bounds for traces in complete intersections and degrees in the NullstellensatzApplicable Algebra in Engineering, Communication and Computing, 1995
- A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic VarietiesJournal of Symbolic Computation, 1993
- On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the realsJournal of Symbolic Computation, 1992
- A new method for solving algebraic systems of positive dimensionDiscrete Applied Mathematics, 1991
- Algorithmes – disons rapides – pour la décomposition d’une variété algébrique en composantes irréductibles et équidimensionnelles1991
- Generalised characteristic polynomialsJournal of Symbolic Computation, 1990
- Gröbner bases and primary decomposition of polynomial idealsJournal of Symbolic Computation, 1988
- Basic principles of mechanical theorem proving in elementary geometriesJournal of Automated Reasoning, 1986