On the public citation graph

A family of centered forms for a polynomial

https://doi.org/10.1007/bf01995115
0 signed · 18 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/bf01954905openalex-snapshot
The number of centered forms for a polynomial
inferredcites →https://doi.org/10.1007/bf02241818openalex-snapshot
Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
inferredcites →https://doi.org/10.1007/bf02252515openalex-snapshot
Low complexity k-dimensional centered forms
inferredcites →https://doi.org/10.1016/0022-247x(81)90215-8openalex-snapshot
Centered forms for functions in several variables
inferredcites →https://doi.org/10.1016/0378-4754(85)90023-0openalex-snapshot
Computer methods for the range of functions
inferredcites →https://doi.org/10.1137/0717055openalex-snapshot
Centered Forms
inferredcites →https://doi.org/10.2307/2004635openalex-snapshot
Topics in Interval Analysis
inferredcites →https://doi.org/10.2307/2008155openalex-snapshot
Computer Methods for the Range of Functions.

What points at this work

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

inferred← citeshttps://doi.org/10.1023/a:1009942430877openalex-snapshot
Bounds for the Range of a Bivariate Polynomial over a Triangle
inferred← citeshttps://doi.org/10.1533/9780857099518.1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1533/9780857099518.109openalex-snapshot
Intersection Tests
inferred← citeshttps://doi.org/10.1533/9780857099518.13openalex-snapshot
Interval Analysis
inferred← citeshttps://doi.org/10.1533/9780857099518.185openalex-snapshot
The SCCI-Hybrid Method for 2D-Curve Tracing
inferred← citeshttps://doi.org/10.1533/9780857099518.219openalex-snapshot
Interval Versions of Bernstein Polynomials, Bézier Curves and the de Casteljau Algorithm
inferred← citeshttps://doi.org/10.1533/9780857099518.241openalex-snapshot
Robust Computations of Selected Discrete Problems
inferred← citeshttps://doi.org/10.1533/9780857099518.297openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1533/9780857099518.61openalex-snapshot
Interval Newton Methods
inferred← citeshttps://doi.org/10.1533/9780857099518.79openalex-snapshot
The Exact Sign of Sum Algorithm (ESSA)
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.