Finding irreducible components of some real transcendental varieties
- 1 June 1994
- journal article
- research article
- Published by Springer Nature in computational complexity
- Vol. 4 (2) , 107-132
- https://doi.org/10.1007/bf01202285
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Single Exponential Path Finding in Semi-algebraic Sets, Part II: The General CasePublished by Springer Nature ,1994
- On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier eliminationJournal of Symbolic Computation, 1992
- Computing the irreducible real factors and components of an algebraic curveApplicable Algebra in Engineering, Communication and Computing, 1990
- Sur la complexité du principe de Tarski-SeidenbergBulletin de la Société Mathématiques de France, 1990
- Complexity of deciding Tarski algebraJournal of Symbolic Computation, 1988
- Solving systems of polynomial inequalities in subexponential timeJournal of Symbolic Computation, 1988
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential timeJournal of Mathematical Sciences, 1986
- Factorization of polynomials over a finite field and the solution of systems of algebraic equationsJournal of Mathematical Sciences, 1986
- Algebraic GeometryPublished by Springer Nature ,1977
- Basic Algebraic GeometryPublished by Springer Nature ,1974