Faster integer multiplication
From MaRDI portal
Recommendations
Cited in
(76)- On the expressive power of univariate equations over sets of natural numbers
- Parsing Boolean grammars over a one-letter alphabet using online convolution
- Tighter Fourier transform lower bounds
- Fast algorithm of square rooting in some finite fields of odd characteristic
- On the distribution of Atkin and Elkies primes for reductions of elliptic curves on average
- On computation of the Bessel function by summing up the series
- Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
- Dirichlet’s proof of the three-square theorem: An algorithmic perspective
- The I/O complexity of Toom-Cook integer multiplication
- On the hardness of approximate and exact (bichromatic) maximum inner product
- On the computational complexity of compressed power series
- A fast algorithm for computing the digamma function
- Tensors in computations
- On the complexity of inverting integer and polynomial matrices
- Deterministic factorization of sums and differences of powers
- On a fast algorithm for computing the Fourier transform
- On the complexity of integer matrix multiplication
- On Faster Integer Calculations Using Non-arithmetic Primitives
- New width parameters for SAT and \#SAT
- Faster integer multiplication using short lattice vectors
- A search for Wilson primes
- Fast on-line integer multiplication
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- On the universality of product for classes of linear functions of two variables
- Fast on-line integer multiplication
- Even faster integer multiplication
- A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line
- Fast evaluation algorithms for elementary algebraic and inverse functions using the FEE method
- Computing L-series of geometrically hyperelliptic curves of genus three
- Theoretical computer science: computational complexity
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- A self-tester for linear functions over the integers with an elementary proof of correctness
- Integer multiplication in time \(O(n\log n)\)
- Fast structured matrix computations: tensor rank and Cohn-Umans method
- Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
- Squeezing Feasibility
- On the complexity of Fibonacci coding
- Faster integer multiplication using plain vanilla FFT primes
- A survey on delegated computation
- Algorithmic counting of nonequivalent compact Huffman codes
- Polynomial multiplication over finite fields in time O(n n)
- On the complexity of computing with planar algebraic curves
- Computing the depth distribution of a set of boxes
- The complexity of solving low degree equations over ring of integers and residue rings
- On the complexity of regular-grammars with integer attributes
- A simple and fast method for computing the Poisson binomial distribution function
- A babystep-giantstep method for faster deterministic integer factorization
- scientific article; zbMATH DE number 7250154 (Why is no real title available?)
- Faster integer multiplication
- Linear differential equations as a data structure
- Counting composites with two strong liars
- Space saving by dynamic algebraization based on tree-depth
- Efficient computation of the characteristic polynomial of a threshold graph
- How fast can we multiply large integers on an actual computer?
- Multiplication
- A faster tree-decomposition based algorithm for counting linear extensions
- Nearly optimal refinement of real roots of a univariate polynomial
- scientific article; zbMATH DE number 4104356 (Why is no real title available?)
- Efficient authentication from hard learning problems
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms
- Multiplication is the easiest nontrivial arithmetic function
- Efficient computation of the characteristic polynomial of a threshold graph
- Efficient computation of the characteristic polynomial of a tree and related tasks
- A framework for deterministic primality proving using elliptic curves with complex multiplication
- Fast integer multiplication using generalized Fermat primes
- Bounded-degree factors of lacunary multivariate polynomials
- Fast computation of the number of solutions to \(x_1^2 + \cdots + x_k^2 \equiv \lambda \pmod{n}\)
- Lower Bounds for Multiplication via Network Coding
- Faster sparse multivariate polynomial interpolation of straight-line programs
- On the Complexity of Bounded Context Switching.
- The numerical solution of fractional integral equations via orthogonal polynomials in fractional powers
- Efficient Multiplication of Somewhat Small Integers Using Number-Theoretic Transforms
- Fast integer multiplication using modular arithmetic
- Faster deterministic integer factorization
- Backtracking-assisted multiplication
This page was built for publication: Faster integer multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575156)
