scientific article; zbMATH DE number 1042857
From MaRDI portal
Publication:4346406
Recommendations
Cited in
(37)- A very personal reminiscence on the problem of computational complexity
- Computational depth and reducibility
- Polynomial expressions for non-binomial structures
- Computational aspects of relaxation complexity
- A certified program for the Karatsuba method to multiply polynomials
- ``Complex numbers and the problem of multiplication between quantities
- Counting intersections of normal curves
- The computational complexity of Angry Birds
- Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
- On a fast algorithm for computing the Fourier transform
- A fast algorithm for computing the digamma function
- Computing (and Life) Is All about Tradeoffs
- Improved three-way split formulas for binary polynomial multiplication
- Even faster integer multiplication
- AI-completeness: using deep learning to eliminate the human factor
- scientific article; zbMATH DE number 3982519 (Why is no real title available?)
- Complexity of computation in finite fields
- scientific article; zbMATH DE number 733791 (Why is no real title available?)
- scientific article; zbMATH DE number 1124602 (Why is no real title available?)
- scientific article; zbMATH DE number 2161249 (Why is no real title available?)
- scientific article; zbMATH DE number 946634 (Why is no real title available?)
- scientific article; zbMATH DE number 850077 (Why is no real title available?)
- On computation of the Bessel function by summing up the series
- Polynomial multiplication over finite fields in time O(n n)
- Derivation and analysis of fast bilinear algorithms for convolution
- Multiplication
- Efficient formal verification of bounds of linear programs
- Computational Complexity
- On the computational complexity of compressed power series
- Igor Moiseevich Krichever (in memoirs)
- Secure collaborative supply chain planning and inverse optimization -- the JELS model
- Is computational complexity a barrier to manipulation?
- A review of mathematical and computational aspects of CSIDH algorithms
- Algorithmic counting of nonequivalent compact Huffman codes
- Complex matrix inversion via real matrix inversions
- Error analysis of sum-product algorithms under stochastic rounding
- The lack-of-preference law and the corresponding distributions in frequency probability theory
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4346406)
