scientific article; zbMATH DE number 1042857
From MaRDI portal
Publication:4346406
zbMath0872.68068MaRDI QIDQ4346406
Publication date: 5 August 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (19)
Improved Three-Way Split Formulas for Binary Polynomial Multiplication ⋮ On computation of the Bessel function by summing up the series ⋮ A certified program for the Karatsuba method to multiply polynomials ⋮ Even faster integer multiplication ⋮ Counting intersections of normal curves ⋮ Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) ⋮ Complexity of computation in finite fields ⋮ The lack-of-preference law and the corresponding distributions in frequency probability theory ⋮ On a fast algorithm for computing the Fourier transform ⋮ On the computational complexity of compressed power series ⋮ Secure collaborative supply chain planning and inverse optimization -- the JELS model ⋮ Igor Moiseevich Krichever (in memoirs) ⋮ A fast algorithm for computing the digamma function ⋮ Derivation and Analysis of Fast Bilinear Algorithms for Convolution ⋮ Polynomial expressions for non-binomial structures ⋮ AI-Completeness: Using Deep Learning to Eliminate the Human Factor ⋮ Efficient Formal Verification of Bounds of Linear Programs ⋮ Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count ⋮ Unnamed Item
This page was built for publication:
