On the public citation graph
The Computation of Powers of Symbolic Polynomials
0 signed · 17 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/sapm1974532145openalex-snapshot
On the Computation of Powers of Sparse Polynomials
inferredcites →https://doi.org/10.1016/s0022-0000(72)80037-0openalex-snapshot
Computation of powers of multivariate polynomialsover the integers
inferredcites →https://doi.org/10.1016/s0022-0000(73)80003-0openalex-snapshot
The efficient calculation of powers of polynomials
inferredcites →https://doi.org/10.1090/s0025-5718-1971-0301966-0openalex-snapshot
The Fast Fourier Transform in a Finite Field
inferredcites →https://doi.org/10.1090/s0025-5718-1972-0314303-3openalex-snapshot
Optimal multiplication chains for computing a power of a symbolic polynomial
inferredcites →https://doi.org/10.1137/0203016openalex-snapshot
Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-32973-9_20openalex-snapshot
Sparse Polynomial Powering Using Heaps
inferred← citeshttps://doi.org/10.1016/s0026-2692(96)00150-4openalex-snapshot
A routing strategy based on genetic algorithms
inferred← citeshttps://doi.org/10.1070/rm1981v036n06abeh003102openalex-snapshot
Complexity problems in computational theory
inferred← citeshttps://doi.org/10.1090/s0025-5718-1986-0829630-0openalex-snapshot
Effect of Improved Multiplication Efficiency on Exponentiation Algorithms Derived from Addition Chains
inferred← citeshttps://doi.org/10.1109/ecai.2018.8679082openalex-snapshot
An Artificial Bee Colony Approach for Classification of Remote Sensing Imagery
inferred← citeshttps://doi.org/10.1109/icstc.2017.8011863openalex-snapshot
Parallelization of modular exponentiations of polynomials
inferred← citeshttps://doi.org/10.1109/tr.2024.3353908openalex-snapshot
Which Coefficients Matter Most—Consecutive $k$-Out-of-$n$:$F$ Systems Revisited
inferred← citeshttps://doi.org/10.1137/0208050openalex-snapshot
A Family of Algorithms for Powering Sparse Polynomials
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.