Pages that link to "Item:Q2548172"
From MaRDI portal
The following pages link to Fast multiplication of large numbers (Q2548172):
Displaying 50 items.
- On the complexity of skew arithmetic (Q260085) (← links)
- Computation of integral bases (Q271785) (← links)
- Explicit primality criteria for \(h \cdot 2^n \pm 1\) (Q284473) (← links)
- A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic (Q285264) (← links)
- An improved deterministic algorithm for generating different many-element random samples (Q287046) (← links)
- Variants of the Selberg sieve, and bounded intervals containing many primes (Q289940) (← links)
- A fast algorithm for computing large Fibonacci numbers (Q294835) (← links)
- Even faster integer multiplication (Q306687) (← links)
- Homomorphic AES evaluation using the modified LTV scheme (Q310240) (← links)
- On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- Algorithmic theory of free solvable groups: randomized computations. (Q402669) (← links)
- On the distribution of Atkin and Elkies primes (Q404278) (← links)
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- Accelerating Pollard's rho algorithm on finite fields (Q431795) (← links)
- Single-factor lifting and factorization of polynomials over local fields (Q438687) (← links)
- Relaxed algorithms for \(p\)-adic numbers (Q449711) (← links)
- Higher Newton polygons and integral bases (Q472859) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- Comments to my works, written by myself (Q483174) (← links)
- The computational complexity and approximability of a series of geometric covering problems (Q483201) (← links)
- Efficient computation of the characteristic polynomial of a threshold graph (Q507427) (← links)
- Efficient computation of the characteristic polynomial of a tree and related tasks (Q528854) (← links)
- Chunky and equal-spaced polynomial multiplication (Q540329) (← links)
- Fast arithmetic with general Gauß periods (Q598216) (← links)
- On the complexity of regular-grammars with integer attributes (Q632805) (← links)
- New higher-order methods for the simultaneous inclusion of polynomial zeros (Q639989) (← links)
- Sequential solution to Kepler's equation (Q642374) (← links)
- Fast computation of the number of solutions to \(x_1^2 + \cdots + x_k^2 \equiv \lambda \pmod{n}\) (Q669241) (← links)
- Backtracking-assisted multiplication (Q680916) (← links)
- Existence and efficient construction of fast Fourier transforms on supersolvable groups (Q685713) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
- Controlled non-uniform random generation of decomposable structures (Q708203) (← links)
- Functional decomposition of polynomials: the wild case (Q755793) (← links)
- Dynamic programming bi-criteria combinatorial optimization (Q777429) (← links)
- Bit complexity of matrix products (Q808706) (← links)
- A unified FFT-based approach to maximum assignment problems related to transitive finite group actions (Q820943) (← links)
- Optimal 2-constraint satisfaction via sum-product algorithms (Q844150) (← links)
- Quantum mechanical algorithm for solving quadratic residue equation (Q849108) (← links)
- Fast matrix multiplication is stable (Q879926) (← links)
- On the complexity of inverting integer and polynomial matrices (Q901933) (← links)
- On computational efficiency for multi-precision zero-finding methods (Q945380) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- Newton's method and FFT trading (Q979146) (← links)
- A low complexity probabilistic test for integer multiplication (Q983183) (← links)
- Integer programming with 2-variable equations and 1-variable inequalities (Q987826) (← links)
- Computing rank-width exactly (Q989474) (← links)
- Parallel implementation of multiple-precision arithmetic and 2,576,980,370,000 decimal digits of \(\pi \) calculation (Q991138) (← links)
- A randomized sublinear time parallel GCD algorithm for the EREW PRAM (Q991752) (← links)
