Fast parallel matrix and GCD computations
From MaRDI portal
Cited in
(77)- Factoring sparse multivariate polynomials
- Fast parallel absolute irreducibility testing
- Irreducibility of multivariate polynomials
- Polynomial division and its computational complexity
- Algebraic complexity of computing polynomial zeros
- The complexity of elementary algebra and geometry
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- Computer algebra: Past and future
- Complexity of parallel matrix computations
- Constructing a perfect matching is in random NC
- On the computational complexity of the Abelian permutation group structure, membership and intersection problems
- A logarithmic Boolean time algorithm for parallel polynomial division
- A systolic algorithm for extended GCD computation
- Parallel algorithms for solvable permutation groups
- Feasible arithmetic computations: Valiant's hypothesis
- Parallel evaluation of the determinant and of the inverse of a matrix
- The iterated mod problem
- Matrix structures in parallel matrix computations
- Circuits for computing the GCD of two polynomials over an algebraic number field
- Matrix inversion in RNC\(^ 1\)
- On the evaluation of the eigenvalues of a banded Toeplitz block matrix
- Parallel solution of Toeplitzlike linear systems
- Parallel algebraic reductions among numerical problems
- The complexity of circuit value and network stability
- NC algorithms for real algebraic numbers
- Computing the inertia of Bézout and Hankel matrices
- Parametrization of Newton's iteration for computations with structured matrices and applications
- Improved processor bounds for combinatorial problems in RNC
- Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets
- Sparse hard sets for P: Resolution of a conjecture of Hartmanis
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
- The computational complexity of some problems of linear algebra
- Spectral properties of some matrices close to the Toeplitz triangular form
- Oracle computations in parallel numerical linear algebra
- Specified precision polynomial root isolation is in NC
- Lower bounds for diophantine approximations
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
- Fast and efficient solution of path algebra problems
- Fast and efficient parallel solution of dense linear systems
- How strong is Nisan's pseudo-random generator?
- On arithmetic branching programs
- Efficient algorithmic learning of the structure of permutation groups by examples
- A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals
- The price of query rewriting in ontology-based data access
- Efficient parallel factorization and solution of structured and unstructured linear systems
- The enumerability of P collapses P to NC
- Inversion in finite fields using logarithmic depth
- Applications of matrix methods to the theory of lower bounds in computational complexity
- Boolean circuits versus arithmetic circuits
- Types of depth and formula size
- Formalisation of the computation of the echelon form of a matrix in Isabelle/HOL
- Comparative Analysis of Random Generators
- Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
- On parallel complexity of analytic functions
- Structure and importance of logspace-MOD class
- Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic
- Fast parallel algorithms for polynomial division over an arbitrary field of constants
- Probabilistic logarithmic-space algorithms for Laplacian solvers
- ON THE MINIMAL POLYNOMIAL OF A MATRIX
- Division-free computation of subresultants using Bezout matrices
- Parallel output-sensitive algorithms for combinatorial and linear algebra problems
- Markov chains and unambiguous automata
- Towards a quantum-resistant weak verifiable delay function
- Linearly representable submodular functions: an algebraic algorithm for minimization
- Decomposition of algebras over finite fields and number fields
- Nondeterministic quasi-polynomial time is average-case hard for \textsf{ACC} circuits
- A polynomial degree bound on equations for non-rigid matrices and small linear circuits
- Efficiently computing the minimum rank of a matrix in a monoid of zero-one matrices
- Accurate approximate diagnosis of (controllable) stochastic systems
- Parallelism and fast solution of linear systems
- Analysis of Euclidean algorithms for polynomials over finite fields
- Parallel models of computation: An introductory survey
- Problems complete for \(\oplus L\)
- Subtree isomorphism is in random NC
- A randomized sublinear time parallel GCD algorithm for the EREW PRAM
This page was built for publication: Fast parallel matrix and GCD computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4745254)
