On the public citation graph
The evaluation of polynomials
0 signed · 40 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/cpa.3160080107openalex-snapshot
Motivation for working in numerical analysis
inferredcites →https://doi.org/10.1016/0016-0032(55)90856-5openalex-snapshot
Studies in mathematics and mechanics
inferredcites →https://doi.org/10.1145/355580.369074openalex-snapshot
Evaluation of polynomials by computer
inferredcites →https://doi.org/10.6028/nbs.rpt.3371openalex-snapshot
Motivation for working in numerical analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11870814_24openalex-snapshot
Inequalities on Upper Bounds for Real Polynomial Roots
inferred← citeshttps://doi.org/10.1007/3-540-09519-5_86openalex-snapshot
A note on methods for solving systems of polynomial equations with floating point coefficients
inferred← citeshttps://doi.org/10.1007/978-3-030-80851-8_8openalex-snapshot
Another Algebraic Decomposition Method for Masked Implementation
inferred← citeshttps://doi.org/10.1007/978-3-642-34047-5_21openalex-snapshot
Higher-Order Masking Schemes for S-Boxes
inferred← citeshttps://doi.org/10.1007/978-3-662-46706-0_25openalex-snapshot
On the Minimum Number of Multiplications Necessary for Universal Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-662-49301-4_20openalex-snapshot
Polynomial Evaluation and Side Channel Analysis
inferred← citeshttps://doi.org/10.1007/bf01123741openalex-snapshot
Absch�tzung der teilsummen reeller Polynome
inferred← citeshttps://doi.org/10.1007/s00211-025-01454-xopenalex-snapshot
Fast evaluation of real and complex polynomials
inferred← citeshttps://doi.org/10.1007/s11075-025-02234-2openalex-snapshot
Parallel evaluation of sparse polynomials; based on Estrin’s algorithm: conception and analysis of schedulings
inferred← citeshttps://doi.org/10.1007/springerreference_72271openalex-snapshot
Fundamental Theorem of Algebra
inferred← citeshttps://doi.org/10.1016/0010-4655(79)90030-4openalex-snapshot
Bessel functions Jv(x) and Yv(x) of real order and real argument
inferred← citeshttps://doi.org/10.1016/0885-064x(92)90022-4openalex-snapshot
Test complexity of generic polynomials
inferred← citeshttps://doi.org/10.1016/j.amc.2009.11.017openalex-snapshot
Zero-clusters of polynomials: Best approach in supercomputing era
inferred← citeshttps://doi.org/10.1016/j.automatica.2011.08.023openalex-snapshot
Stabilizing polynomial approximation of explicit MPC
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00096-3openalex-snapshot
Data parallel evaluation of univariate polynomials by the Knuth-Eve algorithm
inferred← citeshttps://doi.org/10.1049/ell2.70337openalex-snapshot
Quantum Implementation of S‐Boxes Based on Polynomial Evaluation
inferred← citeshttps://doi.org/10.1070/rm1981v036n06abeh003102openalex-snapshot
Complexity problems in computational theory
inferred← citeshttps://doi.org/10.1109/arith.2011.39openalex-snapshot
Automatic Generation of Fast and Certified Code for Polynomial Evaluation
inferred← citeshttps://doi.org/10.1109/compel.2008.4634700openalex-snapshot
Model Predictive Control of buck DC-DC converter with nonlinear inductor
inferred← citeshttps://doi.org/10.1137/0202007openalex-snapshot
On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
inferred← citeshttps://doi.org/10.1137/0203010openalex-snapshot
Polynomials with Rational Coefficients Which are Hard to Compute
inferred← citeshttps://doi.org/10.1145/363162.363200openalex-snapshot
Methods of evaluating polynomial approximations in function evaluation routines
inferred← citeshttps://doi.org/10.1145/800133.804344openalex-snapshot
Computational complexity of computing polynomials over the fields of real and complex numbers
inferred← citeshttps://doi.org/10.1515/forma-2017-0002openalex-snapshot
Differentiability of Polynomials over Reals
inferred← citeshttps://doi.org/10.1515/forma-2017-0004openalex-snapshot
All Liouville Numbers are Transcendental
inferred← citeshttps://doi.org/10.2478/forma-2013-0005openalex-snapshot
A Test for the Stability of Networks
inferred← citeshttps://doi.org/10.2478/forma-2019-0010openalex-snapshot
On Roots of Polynomials over F [ X ]/ 〈 p 〉
inferred← citeshttps://doi.org/10.2478/v10037-006-0015-yopenalex-snapshot
Multiplication of Polynomials using Discrete Fourier Transformation
inferred← citeshttps://doi.org/10.2478/v10037-006-0017-9openalex-snapshot
Schur's Theorem on the Stability of Networks
inferred← citeshttps://doi.org/10.2478/v10037-008-0035-xopenalex-snapshot
Eigenvalues of a Linear Transformation
inferred← citeshttps://doi.org/10.2478/v10037-012-0021-1openalex-snapshot
Introduction to Rational Functions
inferred← citeshttps://doi.org/10.3182/20080706-5-kr-1001.00652openalex-snapshot
Polynomial Approximation of Closed-form MPC for Piecewise Affine Systems
inferred← citeshttps://doi.org/10.70675/2bd37edcz2b83z4cb5z97ebz3c7d221f9fa9openalex-snapshot
Efficient computation with structured matrices and arithmetic expressions
inferred← citeshttps://doi.org/10.70675/92f81995z9354z4895zaa41zbeb79914d44aopenalex-snapshot
Elementary functions : towards automatically generated, efficient, and vectorizable implementations
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.