On the public citation graph
Some bilinear forms whose multiplicative complexity depends on the field of constants
0 signed · 157 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.3160230204openalex-snapshot
On the number of multiplications necessary to compute certain functions
inferredcites →https://doi.org/10.1016/0024-3795(71)90009-7openalex-snapshot
On multiplication of 2 × 2 matrices
inferredcites →https://doi.org/10.1070/rm1966v021n01abeh004147openalex-snapshot
METHODS OF COMPUTING VALUES OF POLYNOMIALS
inferredcites →https://doi.org/10.1145/322003.322014openalex-snapshot
Algebras Having Linear Multiplicative Complexities
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.4330030503openalex-snapshot
Two approaches to the concurrent implementation of the prime factor algorithm on a hypercube
inferred← citeshttps://doi.org/10.1006/jcom.1997.0466openalex-snapshot
On the Direct Sum Conjecture in the Straight Line Model
inferred← citeshttps://doi.org/10.1007/3-540-11157-3_34openalex-snapshot
The algorithmic complexity of linear algebras
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_52openalex-snapshot
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial
inferred← citeshttps://doi.org/10.1007/3-540-16767-6_47openalex-snapshot
On associative algebras of minimal rank
inferred← citeshttps://doi.org/10.1007/3-540-16776-5_727openalex-snapshot
Fast computation of linear finite-dimensional operators over arbitrary rings
inferred← citeshttps://doi.org/10.1007/3-540-16776-5_730openalex-snapshot
The algorithmic structure of $$\mathfrak{s}\mathfrak{l}(2,k)$$
inferred← citeshttps://doi.org/10.1007/3-540-51082-6_85openalex-snapshot
On the computational complexity of polynomials and bilinear mappings. A survey
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_46openalex-snapshot
On the direct sum conjecture in the straight line model
inferred← citeshttps://doi.org/10.1007/978-1-4615-3422-8_14openalex-snapshot
A Classification of Quadratic Algorithms for Multiplying Polynomials of Small Degree Over Finite Fields
inferred← citeshttps://doi.org/10.1007/978-1-4757-2767-8_6openalex-snapshot
Linear and Cyclic Convolutions
inferred← citeshttps://doi.org/10.1007/978-1-4757-3854-4_6openalex-snapshot
Linear and Cyclic Convolution
inferred← citeshttps://doi.org/10.1007/978-3-030-68869-1_5openalex-snapshot
Trisymmetric Multiplication Formulae in Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-030-71187-0_77openalex-snapshot
Cyclotomic Fast Fourier Transform with Reduced Additive Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_40openalex-snapshot
A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-642-81897-4_2openalex-snapshot
Elements of Number Theory and Polynomial Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-82568-2_4openalex-snapshot
Die numerische Ausführung der diskreten Fourier-Transformation
inferred← citeshttps://doi.org/10.1007/978-3-662-00551-4_2openalex-snapshot
Elements of Number Theory and Polynomial Algebra
inferred← citeshttps://doi.org/10.1007/978-94-009-8543-8_1openalex-snapshot
Application of Complexity of Computations to Signal Processing
inferred← citeshttps://doi.org/10.1007/bf02998222openalex-snapshot
Transformations de Fourier discrètes: algorithmes rapides
inferred← citeshttps://doi.org/10.1007/bfb0021003openalex-snapshot
Towards an “Erlangen program” for general linear systems theory
inferred← citeshttps://doi.org/10.1007/bfb0057595openalex-snapshot
Two-Dimensional Convolution and DFT Computation
inferred← citeshttps://doi.org/10.1007/bfb0078037openalex-snapshot
Elliptic formal groups over ℤ and F p in applications to number theory, computer science and topology
inferred← citeshttps://doi.org/10.1007/s10208-016-9332-xopenalex-snapshot
Fast Structured Matrix Computations: Tensor Rank and Cohn–Umans Method
inferred← citeshttps://doi.org/10.1007/s10623-018-0584-0openalex-snapshot
Gaps between prime numbers and tensor rank of multiplication in finite fields
inferred← citeshttps://doi.org/10.1016/0001-8708(79)90037-9openalex-snapshot
On the multiplicative complexity of the Discrete Fourier Transform
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90031-7openalex-snapshot
Special algorithms for convolutions over Galois fields
inferred← citeshttps://doi.org/10.1016/0024-3795(81)90019-7openalex-snapshot
Direct sums of bilinear algorithms
inferred← citeshttps://doi.org/10.1016/0024-3795(83)80041-xopenalex-snapshot
Rank and optimal computation of generic tensors
inferred← citeshttps://doi.org/10.1016/0024-3795(83)90165-9openalex-snapshot
Commutative algebras of minimal rank
inferred← citeshttps://doi.org/10.1016/0024-3795(84)90143-5openalex-snapshot
On the direct sum conjecture
inferred← citeshttps://doi.org/10.1016/0024-3795(90)90398-vopenalex-snapshot
Generalization of the algebraic discrete fourier transform with application to fast convolutions
inferred← citeshttps://doi.org/10.1016/0024-3795(93)00088-hopenalex-snapshot
Multiplicative complexity of direct sums of quadratic systems
inferred← citeshttps://doi.org/10.1016/0024-3795(94)00017-4openalex-snapshot
Structure of algebras of commutative matrices
inferred← citeshttps://doi.org/10.1016/0045-7906(81)90030-6openalex-snapshot
A comparison of DFT algorithms using a residue architecture
inferred← citeshttps://doi.org/10.1016/0165-1684(83)90021-xopenalex-snapshot
Speed and error analysis of digital convolution using rectangular transforms
inferred← citeshttps://doi.org/10.1016/0165-1684(90)90158-uopenalex-snapshot
Fast fourier transforms: A tutorial review and a state of the art
inferred← citeshttps://doi.org/10.1016/0196-6774(81)90026-2openalex-snapshot
On systems of bilinear forms whose minimal division-free algorithms are all bilinear
inferred← citeshttps://doi.org/10.1016/0196-6774(83)90041-xopenalex-snapshot
Certain systems of bilinear forms whose minimal algorithms are all quadratic
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90010-7openalex-snapshot
An algorithm for polynomial multiplication that does not depend on the ring constants
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90057-jopenalex-snapshot
A classification of algorithms for multiplying polynomials of small degree over finite fields
inferred← citeshttps://doi.org/10.1016/0196-8858(80)90013-5openalex-snapshot
The multiplicative complexity of certain semilinear systems defined by Polynomials
inferred← citeshttps://doi.org/10.1016/0304-3975(79)90017-3openalex-snapshot
On multiplication in algebraic extension fields
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90070-0openalex-snapshot
On the algorithmic complexity of associative algebras
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90108-1openalex-snapshot
On the complexity of multiplication in finite fields
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90119-7openalex-snapshot
A lower bound for polynomial multiplication
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90017-5openalex-snapshot
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial, part I: The algebra G[u] , l>1
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90017-vopenalex-snapshot
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. Part II: The algebra G[u]/〈un〉
inferred← citeshttps://doi.org/10.1016/0378-4754(89)90138-9openalex-snapshot
Knowledge-based FFT and convolution synthesis for any number of points
inferred← citeshttps://doi.org/10.1016/0885-064x(88)90012-xopenalex-snapshot
Algebraic complexities and algebraic curves over finite fields
inferred← citeshttps://doi.org/10.1016/b978-0-12-506995-3.50010-2openalex-snapshot
Efficient Finite Field Algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50016-3openalex-snapshot
Algebraic Complexity Theory
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2023.01.022openalex-snapshot
The equivariant complexity of multiplication in finite field extensions
inferred← citeshttps://doi.org/10.1016/j.jco.2012.02.005openalex-snapshot
Bilinear complexity of algebras and the Chudnovsky–Chudnovsky interpolation method
inferred← citeshttps://doi.org/10.1016/j.jsc.2002.06.001openalex-snapshot
Automatic derivation and implementation of fast convolution algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.02.002openalex-snapshot
Paraunitary matrices, entropy, algebraic condition number and Fourier computation
inferred← citeshttps://doi.org/10.1017/cbo9780511760921openalex-snapshot
Fast Algorithms for Signal Processing
inferred← citeshttps://doi.org/10.1023/b:nody.0000042909.51421.61openalex-snapshot
Nonlinear Behaviour of Structures Using the Volterra Series—Signal Processing and Testing Methods
inferred← citeshttps://doi.org/10.1049/el:19910603openalex-snapshot
Multiplicative complexity of length-2 m two-dimensional discrete cosine transform
inferred← citeshttps://doi.org/10.1049/ip-f-1.1984.0003openalex-snapshot
On the computation of discrete fourier transform using fermat number transform
inferred← citeshttps://doi.org/10.1049/ip-g-1.1983.0036openalex-snapshot
Very fast discrete Fourier transform using number theoretic transform
inferred← citeshttps://doi.org/10.1070/rm9928openalex-snapshot
On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
inferred← citeshttps://doi.org/10.1090/conm/770/15440openalex-snapshot
The quadratic hull of a code and the geometric view on multiplication algorithms
inferred← citeshttps://doi.org/10.1090/s0025-5718-1978-0468306-4openalex-snapshot
On computing the discrete Fourier transform
inferred← citeshttps://doi.org/10.1090/s0025-5718-1980-0572853-3openalex-snapshot
Existence Theorems for Transforms Over Finite Rings with Applications to 2-D Convolution
inferred← citeshttps://doi.org/10.1090/s0273-0979-1979-14686-xopenalex-snapshot
Is computing with the finite Fourier transform pure or applied mathematics?
inferred← citeshttps://doi.org/10.1107/97809553602060000553openalex-snapshot
Crystallographic viewpoints in the classification of space-group representations
inferred← citeshttps://doi.org/10.1109/29.60070openalex-snapshot
Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
inferred← citeshttps://doi.org/10.1109/78.136539openalex-snapshot
Short-length FIR filters and their use in fast nonrecursive filtering
inferred← citeshttps://doi.org/10.1109/78.139244openalex-snapshot
On prime factor mapping for the discrete Hartley transform
inferred← citeshttps://doi.org/10.1109/78.157231openalex-snapshot
On the reduction in multiplicative complexity achieved by the polynomial residue number system
inferred← citeshttps://doi.org/10.1109/78.175736openalex-snapshot
Recursive fast algorithm and the role of the tensor product
inferred← citeshttps://doi.org/10.1109/78.533738openalex-snapshot
A high-speed CMOS implementation of the Winograd Fourier transform algorithm
inferred← citeshttps://doi.org/10.1109/78.80774openalex-snapshot
A concurrent implementation of the prime factor algorithm on hypercube
inferred← citeshttps://doi.org/10.1109/82.329735openalex-snapshot
Rings, fields, the Chinese remainder theorem and an extension-Part I: theory
inferred← citeshttps://doi.org/10.1109/82.329736openalex-snapshot
Rings, fields, the Chinese remainder theorem and an extension-Part II: applications to digital signal processing
inferred← citeshttps://doi.org/10.1109/acssc.1990.523350openalex-snapshot
The Chinese Remainder Theorem, Associative Algebras, and Multiplicative Complexity
inferred← citeshttps://doi.org/10.1109/i2mtc.2019.8827079openalex-snapshot
An algorithm for Implementing Large-point DFT
inferred← citeshttps://doi.org/10.1109/icassp.1977.1170234openalex-snapshot
A new method for computing DFT
inferred← citeshttps://doi.org/10.1109/icassp.1977.1170250openalex-snapshot
Recursive digital filter structures using new high speed convolution algorithms
inferred← citeshttps://doi.org/10.1109/icassp.1980.1170905openalex-snapshot
High speed DFT's using residue numbers
inferred← citeshttps://doi.org/10.1109/icassp.1980.1170995openalex-snapshot
Floating point error bound in the prime factor FFT
inferred← citeshttps://doi.org/10.1109/icassp.1980.1171044openalex-snapshot
Signal processing and complexity of computation
inferred← citeshttps://doi.org/10.1109/icassp.1983.1172193openalex-snapshot
Longer NTT's with 2 as a root of unity
inferred← citeshttps://doi.org/10.1109/icassp.1989.266596openalex-snapshot
Practical fast 1-D DCT algorithms with 11 multiplications
inferred← citeshttps://doi.org/10.1109/iscas.1991.176413openalex-snapshot
Algorithm for p/sup m/-length discrete cosine transform
inferred← citeshttps://doi.org/10.1109/iscas.1992.229990openalex-snapshot
A convolution-based DCT algorithm
inferred← citeshttps://doi.org/10.1109/iscas.1993.393830openalex-snapshot
On the theoretical lower bound of the multiplicative complexity for DCT
inferred← citeshttps://doi.org/10.1109/iscas.1993.692753openalex-snapshot
On the theoretical lower bound of ithe muftiplicative complexity for DCT
inferred← citeshttps://doi.org/10.1109/iscas.1994.408999openalex-snapshot
Extending Winograd's small convolution algorithm to longer lengths
inferred← citeshttps://doi.org/10.1109/itw.2016.7606846openalex-snapshot
Algorithms for structured matrix-vector product of optimal bilinear complexity
inferred← citeshttps://doi.org/10.1109/mcom.1980.1090256openalex-snapshot
Book reviews - Number theory in digital signal processing
inferred← citeshttps://doi.org/10.1109/sbcci69725.2026.11706796openalex-snapshot
Inspection Factorization for Hardware-Efficient 2D Fast Convolution
inferred← citeshttps://doi.org/10.1109/sfcs.1984.715922openalex-snapshot
Multiplication Of Polynomials Over The Ring Of Integers
inferred← citeshttps://doi.org/10.1109/sfcs.1987.41openalex-snapshot
Multiplicative complexity of polynomial multiplication over finite fields
inferred← citeshttps://doi.org/10.1109/tassp.1977.1162973openalex-snapshot
A prime factor FFT algorithm using high-speed convolution
inferred← citeshttps://doi.org/10.1109/tassp.1977.1162981openalex-snapshot
New algorithms for digital convolution
inferred← citeshttps://doi.org/10.1109/tassp.1978.1163075openalex-snapshot
Comments on "A prime factor FFT algorithm using high-speed convolution"
inferred← citeshttps://doi.org/10.1109/tassp.1978.1163134openalex-snapshot
Fixed-point error analysis of winograd Fourier transform algorithms
inferred← citeshttps://doi.org/10.1109/tassp.1979.1163216openalex-snapshot
Fast computation of discrete Fourier transforms using polynomial transforms
inferred← citeshttps://doi.org/10.1109/tassp.1979.1163270openalex-snapshot
A prescription of winograd's discrete Fourier transform algorithm
inferred← citeshttps://doi.org/10.1109/tassp.1980.1163451openalex-snapshot
Complex rectangular transforms for digital convolution
inferred← citeshttps://doi.org/10.1109/tassp.1981.1163637openalex-snapshot
Floating point roundoff error in the prime factor FFT
inferred← citeshttps://doi.org/10.1109/tassp.1985.1164546openalex-snapshot
Algorithms and structures for convolutions over Galois fields
inferred← citeshttps://doi.org/10.1109/tassp.1986.1164797openalex-snapshot
Higher radix aperiodic-convolution algorithms
inferred← citeshttps://doi.org/10.1109/tassp.1987.1165132openalex-snapshot
Multidimensional cyclic convolution algorithms with minimal multiplicative complexity
inferred← citeshttps://doi.org/10.1109/tc.1980.1675631openalex-snapshot
Complex Number Arithmetic with Odd- Valued Logic
inferred← citeshttps://doi.org/10.1109/tc.2004.52openalex-snapshot
A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
inferred← citeshttps://doi.org/10.1109/tc.2005.109openalex-snapshot
Cantor versus Harley: optimization and analysis of explicit formulae for hyperelliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1109/tc.2017.2677427openalex-snapshot
DFT Computation Using Gauss-Eisenstein Basis: FFT Algorithms and VLSI Architectures
inferred← citeshttps://doi.org/10.1109/tcs.1978.1084546openalex-snapshot
Tests for polynomial zeros on a polydisc distinguished boundary
inferred← citeshttps://doi.org/10.1109/tcs.1983.1085292openalex-snapshot
On deriving rectangular transform matrices for cyclic convolution
inferred← citeshttps://doi.org/10.1109/tcsi.2006.885976openalex-snapshot
Low- Cost Parallel FIR Filter Structures With 2-Stage Parallelism
inferred← citeshttps://doi.org/10.1109/tcsi.2008.920068openalex-snapshot
Eigenvalues and Singular Value Decompositions of Reduced Biquaternion Matrices
inferred← citeshttps://doi.org/10.1109/tit.1983.1056705openalex-snapshot
A new structured design method for convolutions over finite fields, Part I
inferred← citeshttps://doi.org/10.1109/tit.2013.2272072openalex-snapshot
An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial
inferred← citeshttps://doi.org/10.1109/tkde.2005.161openalex-snapshot
Continuous similarity-based queries on streaming time series
inferred← citeshttps://doi.org/10.1109/tsp.2008.2009891openalex-snapshot
Cyclotomic FFTs With Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm
inferred← citeshttps://doi.org/10.1109/tsp.2020.3015419openalex-snapshot
Duhamel/Hollmann-Like Discrete Fourier Transform Algorithm With the Smallest Multiplicative Complexity Over a Finite Field
inferred← citeshttps://doi.org/10.1109/tvlsi.2010.2096239openalex-snapshot
Rank Metric Decoder Architectures for Random Linear Network Coding With Error Control
inferred← citeshttps://doi.org/10.1117/12.936463openalex-snapshot
Real Time Considerations For DFT Algorithms
inferred← citeshttps://doi.org/10.1137/0209021openalex-snapshot
On Multiplication of Polynomials Modulo a Polynomial
inferred← citeshttps://doi.org/10.1137/0212007openalex-snapshot
Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties
inferred← citeshttps://doi.org/10.1137/0218013openalex-snapshot
A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras
inferred← citeshttps://doi.org/10.1137/0219031openalex-snapshot
Maximal Rank of $m\times n\times(mn-k)$ Tensors
inferred← citeshttps://doi.org/10.1137/0222037openalex-snapshot
Inverting Polynomials and Formal Power Series
inferred← citeshttps://doi.org/10.1137/s0097539704442118openalex-snapshot
A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields
inferred← citeshttps://doi.org/10.1145/1073884.1073925openalex-snapshot
Multivariate power series multiplication
inferred← citeshttps://doi.org/10.1145/564691.564734openalex-snapshot
Continually evaluating similarity-based pattern queries on a streaming time series
inferred← citeshttps://doi.org/10.1145/58562.59306openalex-snapshot
Multiplicative complexity of polynomial multiplication over finite fields
inferred← citeshttps://doi.org/10.1145/63047.63087openalex-snapshot
The prime factor non-binary discrete Fourier transform and use of Crystal_Router as a general purpose communication routine
inferred← citeshttps://doi.org/10.1145/73007.73024openalex-snapshot
On the extended direct sum conjecture
inferred← citeshttps://doi.org/10.1186/s13640-021-00557-3openalex-snapshot
Approximate calculation of 8-point DCT for various scenarios of practical applications
inferred← citeshttps://doi.org/10.1201/9781420046076-c9openalex-snapshot
Complexity Theory of Transforms in Signal Processing
inferred← citeshttps://doi.org/10.18154/rwth-2015-02185openalex-snapshot
Partitioned convolution algorithms for real-time auralization
inferred← citeshttps://doi.org/10.2307/2006266openalex-snapshot
On Computing the Discrete Fourier Transform
inferred← citeshttps://doi.org/10.2514/2.3083openalex-snapshot
Review of Attitude Representations Used for Aircraft Kinematics
inferred← citeshttps://doi.org/10.2514/3.19953openalex-snapshot
The number of multiplications required to chain coordinate transformations
inferred← citeshttps://doi.org/10.2514/6.2000-4302openalex-snapshot
A review of attitude kinematics for aircraft flight simulation
inferred← citeshttps://doi.org/10.4208/jcm.v13.n4.p351openalex-snapshot
The Multiplicative Complexity and Algorithm of the Generalized Discrete Fourier Transform (GFT)
inferred← citeshttps://doi.org/10.4213/rm9928openalex-snapshot
О тензорном ранге умножения в конечных расширениях конечных полей и о связанных с этим вопросах алгебраической геометрии
inferred← citeshttps://doi.org/10.4310/acta.2019.v222.n2.a3openalex-snapshot
Counterexamples to Strassen’s direct sum conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1103.4335openalex-snapshot
Diviseurs de la forme 2D-G sans sections et rang de la multiplication dans les corps finis (Divisors of the form 2D-G without sections and bilinear complexity of multiplication in finite fields)
inferred← citeshttps://doi.org/10.48550/arxiv.2009.01281openalex-snapshot
Algebraic geometry codes and some applications
inferred← citeshttps://doi.org/10.70675/5094cdcbz9865z4674z8591z6383aef42092openalex-snapshot
Arithmétique efficace des extensions de corps finis
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.