scientific article; zbMATH DE number 3856407
From MaRDI portal
Publication:3325040
Recommendations
- Algorithms for fast polynomial division
- Fast parallel algorithms for polynomial division over an arbitrary field of constants
- Practical divide-and-conquer algorithms for polynomial arithmetic
- On fast multiplication of polynomials over arbitrary algebras
- An efficient division algorithm for polynomial matrices
- A fast algorithm for the division of two polynomial matrices
- scientific article; zbMATH DE number 1262457
- Fast in-place algorithms for polynomial operations
- On the complexity of multivariate polynomial division
Cited in
(63)- Quasi-gcd computations
- Polynomial division and its computational complexity
- A fast numerical algorithm for the composition of power series with complex coefficients
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- A logarithmic Boolean time algorithm for parallel polynomial division
- Cauchy index computation
- Polynomial division with a remainder by means of evaluation and interpolation
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- Simple multivariate polynomial multiplication
- FFT-like multiplication of linear differential operators
- Variations on computing reciprocals of power series
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Implementation of some algorithms for accelerating computer calculations
- Computing the irreducible real factors and components of an algebraic curve
- A note on the power of integer division
- A study of approximate polynomials. I: Representation and arithmetic
- A fast version of the Schur-Cohn algorithm.
- On using RSA/ECC coprocessor for ideal lattice-based key exchange
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- On the complexity of computing with planar algebraic curves
- Modulated string searching
- Fast multiplication of large numbers
- On fast multiplication of polynomials, the Fourier and Hartley transforms
- Faster deterministic integer factorization
- Space- and time-efficient polynomial multiplication
- Faster polynomial multiplication via discrete Fourier transforms
- Practical divide-and-conquer algorithms for polynomial arithmetic
- On the rapid computation of various polylogarithmic constants
- Fast multiplication and its applications
- scientific article; zbMATH DE number 4110094 (Why is no real title available?)
- scientific article; zbMATH DE number 1262457 (Why is no real title available?)
- Relative class number of imaginary Abelian fields of prime conductor below 10000
- scientific article; zbMATH DE number 1504642 (Why is no real title available?)
- scientific article; zbMATH DE number 1559520 (Why is no real title available?)
- Fast integer multiplication using generalized Fermat primes
- Rapid multiplication modulo the sum and difference of highly composite numbers
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- Fast computation of elliptic curve isogenies in characteristic two
- Efficient computation of the characteristic polynomial of a threshold graph
- Multiplication
- Regular estimates for the complexity of polynomial multiplication and truncated Fourier transform
- Complexity and performance results for non FFT-based univariate polynomial multiplication
- Algorithms and Computation
- Architecture-aware classical Taylor shift by 1
- Chunky and equal-spaced polynomial multiplication
- Towards an Implementation of a Computer Algebra System in a Functional Language
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- Fast inversion of triangular Toeplitz matrices
- Nearly optimal computations with structured matrices
- Irregular primes and cyclotomic invariants to 12 million
- Fast evaluation and root finding for polynomials with floating-point coefficients
- Fast norm computation in smooth-degree abelian number fields
- A general approach to isolating roots of a bitstream polynomial
- Fast evaluation and root finding for polynomials with floating-point coefficients
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Factoring sparse polynomials fast
- Hypergeometric L-functions in average polynomial time. II
- Fast interpolation and multiplication of unbalanced polynomials
- Fast evaluation of real and complex polynomials
- Fast modular composition using spiroids
- Fast computation of multinomial coefficients
- Faster polynomial multiplication via multipoint Kronecker substitution
- Nearly optimal refinement of real roots of a univariate polynomial
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 Q3325040)
