scientific article; zbMATH DE number 3322464
From MaRDI portal
Publication:5601777
zbMath0203.15604MaRDI QIDQ5601777
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Tensors in computations, Improved Three-Way Split Formulas for Binary Polynomial Multiplication, On Computing the Discrete Fourier Transform, On computation of the Bessel function by summing up the series, Lattice-based zero-knowledge arguments for additive and multiplicative relations, Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power, Even faster integer multiplication, Algebraic complexity of computing polynomial zeros, The amended DSeSC power method for polynomial root-finding, Polynomial Multiplication over Finite Fields in Time \( O(n \log n \), Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. I: The algebra \(G[u/<Q(u)^{\ell}>\), \(\ell >1\)], Complexity of computation in finite fields, When NTT meets Karatsuba: preprocess-then-NTT technique revisited, On the computational complexity of compressed power series, Complexity of algorithms and computations, On the Minimum Computation Time of Functions, Fast structured matrix computations: tensor rank and Cohn-Umans method, Fast matrix multiplication and its algebraic neighbourhood, Fast integer multiplication using generalized Fermat primes, On the complexity of multiplication in finite fields, A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes, Faster Multiplication in GF(2)[x], On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings, Derivation and Analysis of Fast Bilinear Algorithms for Convolution, On computational efficiency for multi-precision zero-finding methods, Deterministic computation of the characteristic polynomial in the time of matrix multiplication, New algorithms for relaxed multiplication, Backtracking-assisted multiplication, Polynomial division with a remainder by means of evaluation and interpolation, Chunky and equal-spaced polynomial multiplication, Improved algorithms for computing determinants and resultants, Acceleration of linear stationary iterative processes in multiprocessor computers: II, A low-complexity LUT-based squaring algorithm, New progress in real and complex polynomial root-finding, Newton's method and FFT trading, Improved method for finding optimal formulas for bilinear maps in a finite field, On the complexity of Fibonacci coding, Fast convolutions meet Montgomery, Characteristic measures of switching functions, Multiplication algorithm based on Collatz function, A faster algorithm for reducing the computational complexity of convolutional neural networks, A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers, Polynomial Evaluation and Side Channel Analysis, Number theoretic transform: generalization, optimization, concrete analysis and applications, Lower Bounds for Multiplication via Network Coding, Code Generation for Polynomial Multiplication, On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry, Unnamed Item, The multiplicative complexity of certain semilinear systems defined by polynomials, Recent developments in primality proving, Efficient big integer multiplication and squaring algorithms for cryptographic applications, Recent advances in text-to-pattern distance algorithms, Relax, but don't be too lazy, Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology, Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists
