Detecting algebraic curves in bad position
From MaRDI portal
Publication:5937884
DOI10.1006/jsco.2000.0424zbMath0977.14028OpenAlexW2004799827MaRDI QIDQ5937884
No author found.
Publication date: 28 January 2002
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.2000.0424
Symbolic computation and algebraic computation (68W30) Plane and space curves (14H50) Computational aspects of algebraic curves (14Q05)
Cites Work
- The computation of polynomial greatest common divisors over an algebraic number field
- Singular points of algebraic curves
- Symbolic parametrization of curves
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Ideal basis and primary decompositions: case of two variables
- Applied algebra, algebraic algorithms and error-correcting codes. 11th international symposium, AAECC-11, Paris, France, July 17-22, 1995. Proceedings
- An improved upper complexity bound for the topology computation of a real algebraic plane curve
- On improving approximate results of Buchberger's algorithm by Newton's method
- Computer Algebra of Polynomials and Rational Functions
- The Calculation of Multivariate Polynomial Resultants
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Detecting algebraic curves in bad position