Polynomial division and its computational complexity
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3856407 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3782281 (Why is no real title available?)
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- scientific article; zbMATH DE number 3566175 (Why is no real title available?)
- scientific article; zbMATH DE number 3624682 (Why is no real title available?)
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- scientific article; zbMATH DE number 3383473 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Algebraic complexity of computing polynomial zeros
- Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications
- Error analysis of an APA algorithm for the parallel solution of some special Toeplitz linear systems
- Evaluating Polynomials at Fixed Sets of Points
- Fast computation of GCDs
- Fast parallel matrix and GCD computations
- Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- How to multiply matrices faster
- Logarithmic Depth Circuits for Algebraic Functions
- On the computational power of pushdown automata
- Parallel Solution of Certain Toeplitz Linear Systems
- Parallel computation for well-endowed rings and space-bounded probabilistic machines
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms
- The bit-complexity of arithmetic algorithms
- The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic
- The bit-operation complexity of matrix multiplication and of all pair shortest path problem
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
Cited in
(32)- Fast approximate inversion of a block triangular Toeplitz matrix with applications to fractional sub-diffusion equations.
- Efficient Algorithms for the Evaluation of the Eigenvalues of (Block) Banded Toeplitz Matrices
- Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power
- Toeplitz matrices for LTI systems, an illustration of their application to Wiener filters and estimators
- A fast algorithm for the division of two polynomial matrices
- Computations with infinite Toeplitz matrices and polynomials
- A new parallel polynomial division by a separable polynomial via Hermite interpolation with applications
- Polynomial division with a remainder by means of evaluation and interpolation
- Approximate real polynomial division via approximate inversion of real triangular Toeplitz matrices
- Inversion in finite fields using logarithmic depth
- A logarithmic Boolean time algorithm for parallel polynomial division
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant
- Variations on computing reciprocals of power series
- An algebraic approach to approximate evaluation of a polynomial on a set of real points
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Binary segmentation for matrix and vector operations
- Polynomial division using left shift register
- Parallel algorithms for matrix polynomial division
- scientific article; zbMATH DE number 2034379 (Why is no real title available?)
- Matrix structures in parallel matrix computations
- Fast inversion of triangular Toeplitz matrices
- Improved Parallel Polynomial Division
- Algebraic complexity of computing polynomial zeros
- A fast direct method for block triangular Toeplitz-like with tri-diagonal block systems from time-fractional partial differential equations
- Solving certain queueing problems modelled by Toeplitz matrices
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- On the evaluation of the eigenvalues of a banded Toeplitz block matrix
- A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices
- Algorithms for fast polynomial division
- scientific article; zbMATH DE number 3924143 (Why is no real title available?)
- Fast parallel algorithms for polynomial division over an arbitrary field of constants
- scientific article; zbMATH DE number 3958730 (Why is no real title available?)
This page was built for publication: Polynomial division and its computational complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094135)
