On the public citation graph

Computing the irreducible real factors and components of an algebraic curve

https://doi.org/10.1007/bf01810297
0 signed · 29 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-51082-6_79openalex-snapshot
Newton symmetric functions and the arithmetic of algebraically closed fields
inferredcites →https://doi.org/10.1007/978-3-030-98767-1_7openalex-snapshot
Integration of Algebraic Functions
inferredcites →https://doi.org/10.1007/978-3-7091-3406-1_12openalex-snapshot
Computing in Algebraic Extensions
inferredcites →https://doi.org/10.1007/978-3-7091-3406-1_16openalex-snapshot
Some Useful Bounds
inferredcites →https://doi.org/10.1007/978-3-7091-7551-4_16openalex-snapshot
Some Useful Bounds
inferredcites →https://doi.org/10.1016/b978-0-12-587260-7.50007-8openalex-snapshot
Infallible Calculation of Polynomial Zeros to Specified Precision
inferredcites →https://doi.org/10.1016/s0747-7171(85)80029-8openalex-snapshot
Fast parallel absolute irreducibility testing
inferredcites →https://doi.org/10.1016/s0747-7171(87)80055-xopenalex-snapshot
Deterministic irreducibility testing of polynomials over large finite fields
inferredcites →https://doi.org/10.1090/s0025-5718-1974-0345940-xopenalex-snapshot
The Minimum Root Separation of a Polynomial
inferredcites →https://doi.org/10.1109/sfcs.1988.21945openalex-snapshot
A faster PSPACE algorithm for deciding the existential theory of the reals
inferredcites →https://doi.org/10.1137/0213054openalex-snapshot
Cylindrical Algebraic Decomposition I: The Basic Algorithm
inferredcites →https://doi.org/10.1137/0214035openalex-snapshot
Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
inferredcites →https://doi.org/10.1145/322077.322084openalex-snapshot
A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
inferredcites →https://doi.org/10.1145/355705.355710openalex-snapshot
An Exact Method for Finding the Roots of a Complex Polynomial
inferredcites →https://doi.org/10.1145/62212.62257openalex-snapshot
Some algebraic and geometric computations in PSPACE
inferredcites →https://doi.org/10.1307/mmj/1028999140openalex-snapshot
An inequality for the discriminant of a polynomial.
inferredcites →https://doi.org/10.2307/1969640openalex-snapshot
A New Decision Method for Elementary Algebra
inferredcites →https://doi.org/10.2307/2322348openalex-snapshot
Basic Algebra I.
inferredcites →https://doi.org/10.24033/bsmf.760openalex-snapshot
Sur quelques théorèmes de M. Petrovitch relatifs aux zéros des fonctions analytiques

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jcom.1995.1007openalex-snapshot
Complexity of Finding Irreducible Components of a Semialgebraic Set
inferred← citeshttps://doi.org/10.1007/bf01202285openalex-snapshot
Finding irreducible components of some real transcendental varieties
inferred← citeshttps://doi.org/10.1007/bfb0023837openalex-snapshot
Polynomial factorization 1987–1991
inferred← citeshttps://doi.org/10.1016/0167-8396(92)90009-eopenalex-snapshot
Degree, multiplicity, and inversion formulas for rational surfaces using u-resultants
inferred← citeshttps://doi.org/10.1016/j.jco.2007.01.008openalex-snapshot
Lifting and recombination techniques for absolute factorization
inferred← citeshttps://doi.org/10.1090/s0025-5718-02-01428-xopenalex-snapshot
Factoring multivariate polynomials via partial differential equations
inferred← citeshttps://doi.org/10.1109/synasc.2010.76openalex-snapshot
Polynomial GCD and Factorization via Approximate Gröbner Bases
inferred← citeshttps://doi.org/10.1145/103418.103431openalex-snapshot
Effective Noether irreducibility forms and applications
inferred← citeshttps://doi.org/10.1145/1837934.1837979openalex-snapshot
Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method
inferred← citeshttps://doi.org/10.1145/281508.281624openalex-snapshot
Efficient algorithms for computing the nearest polynomial with constrained roots
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.