Computing the irreducible real factors and components of an algebraic curve
- 1 September 1990
- journal article
- research article
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 1 (2) , 135-148
- https://doi.org/10.1007/bf01810297
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Deterministic irreducibility testing of polynomials over large finite fieldsJournal of Symbolic Computation, 1987
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial FactorizationSIAM Journal on Computing, 1985
- Fast parallel absolute irreducibility testingJournal of Symbolic Computation, 1985
- Cylindrical Algebraic Decomposition I: The Basic AlgorithmSIAM Journal on Computing, 1984
- Some Useful BoundsPublished by Springer Nature ,1982
- Computing in Algebraic ExtensionsPublished by Springer Nature ,1982
- Infallible Calculation of Polynomial Zeros to Specified PrecisionPublished by Elsevier ,1977
- The minimum root separation of a polynomialMathematics of Computation, 1974
- An inequality for the discriminant of a polynomial.The Michigan Mathematical Journal, 1964
- Sur quelques théorèmes de M. Petrovitch relatifs aux zéros des fonctions analytiquesBulletin de la Société Mathématiques de France, 1905