On the public citation graph

Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments

0 signed · 34 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.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.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.1145/366274.366319openalex-snapshot
Algorithm 158 (algorithm 134, revised) exponention of series

What points at this work

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

inferred← citeshttps://doi.org/10.1002/sapm1974532145openalex-snapshot
On the Computation of Powers of Sparse Polynomials
inferred← citeshttps://doi.org/10.1007/3-540-11607-9_2openalex-snapshot
An adaptive hybrid algorithm for multiplying dense polynomials
inferred← citeshttps://doi.org/10.1007/978-3-642-32973-9_20openalex-snapshot
Sparse Polynomial Powering Using Heaps
inferred← citeshttps://doi.org/10.1007/978-3-7091-3406-1_13openalex-snapshot
Arithmetic in Basic Algebraic Domains
inferred← citeshttps://doi.org/10.1007/978-3-7091-7551-4_13openalex-snapshot
Arithmetic in Basic Algebraic Domains
inferred← citeshttps://doi.org/10.1007/bf00268498openalex-snapshot
Another polynomial homomorphism
inferred← citeshttps://doi.org/10.1007/bf02575654openalex-snapshot
On efficiency measurement of algebraic data structures encodings
inferred← citeshttps://doi.org/10.1007/bfb0052247openalex-snapshot
Efficient algorithms for elliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1016/0895-7177(90)90081-wopenalex-snapshot
Parallel algorithms for some algebraic operations on polynomial equations
inferred← citeshttps://doi.org/10.1016/b978-0-08-057115-7.50028-5openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/b978-0-08-057115-7.50031-5openalex-snapshot
Copyright
inferred← citeshttps://doi.org/10.1016/j.jsc.2012.06.004openalex-snapshot
On the bit-complexity of sparse polynomial and series multiplication
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80108-3openalex-snapshot
Parallel multiplication and powering of polynomials
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/12.508323openalex-snapshot
A new architecture for a parallel finite field multiplier with low complexity based on composite fields
inferred← citeshttps://doi.org/10.1109/49.1927openalex-snapshot
Architectures for exponentiation in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/dmcc.1990.555390openalex-snapshot
Parallel Methods for Solving Polynomial Problems on Distributed Memory Multicomputers
inferred← citeshttps://doi.org/10.1137/0204016openalex-snapshot
The Computation of Powers of Symbolic Polynomials
inferred← citeshttps://doi.org/10.1137/0206042openalex-snapshot
Fast Algorithms for Partial Fraction Decomposition
inferred← citeshttps://doi.org/10.1145/1089263.1089266openalex-snapshot
Efficient polynomial substitutions of a sparse argument
inferred← citeshttps://doi.org/10.1145/23002.27646openalex-snapshot
A fast, low-space algorithm for multiplying dense multivariate polynomials
inferred← citeshttps://doi.org/10.1145/2790282.2790285openalex-snapshot
Parallel sparse multivariate polynomial division
inferred← citeshttps://doi.org/10.1145/322092.322099openalex-snapshot
Fast Algorithms for Manipulating Formal Power Series
inferred← citeshttps://doi.org/10.1145/800205.806332openalex-snapshot
Practical fast polynomial multiplication
inferred← citeshttps://doi.org/10.1145/800206.806381openalex-snapshot
A case study in interlanguage communication
inferred← citeshttps://doi.org/10.1201/9781584888239-c18openalex-snapshot
Applications of FFT and Structured Matrices
inferred← citeshttps://doi.org/10.14264/301226openalex-snapshot
Elliptic curve cryptosystem development and design
inferred← citeshttps://doi.org/10.2172/10178160openalex-snapshot
Automatic differentiation bibliography
inferred← citeshttps://doi.org/10.2172/7250022openalex-snapshot
Automatic differentiation bibliography
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.