Pages that link to "Item:Q794429"
From MaRDI portal
The following pages link to On computing the determinant in small parallel time using a small number of processors (Q794429):
Displaying 50 items.
- Faster geometric algorithms via dynamic determinant computation (Q283878) (← links)
- Cancellation is exponentially powerful for computing the determinant (Q287054) (← links)
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set (Q464735) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- Elementary recursive quantifier elimination based on Thom encoding and sign determination (Q529166) (← links)
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- On a generalization of Stickelberger's theorem (Q607067) (← links)
- Lower bounds for the determinantal complexity of explicit low degree polynomials (Q639850) (← links)
- Lower bounds for monotone span programs (Q677989) (← links)
- Decomposition of algebras over finite fields and number fields (Q685720) (← links)
- Evaluation properties of invariant polynomials (Q731933) (← links)
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields (Q752692) (← links)
- Simple algorithms for approximating all roots of a polynomial with real roots (Q757494) (← links)
- The Faddeev-LeVerrier algorithm and the Pfaffian (Q820990) (← links)
- Parallelism and fast solution of linear systems (Q911213) (← links)
- Parallel complexity of the regular code problem (Q913513) (← links)
- Parallel models of computation: An introductory survey (Q916358) (← links)
- Problems complete for \(\oplus L\) (Q918696) (← links)
- On sign conditions over real multivariate polynomials (Q977180) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- On the complexity of counting components of algebraic varieties (Q1030247) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field (Q1097640) (← links)
- Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field (Q1111375) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- Parallel evaluation of the determinant and of the inverse of a matrix (Q1115596) (← links)
- Rubber bands, convex embeddings and graph connectivity (Q1121282) (← links)
- Circuits for computing the GCD of two polynomials over an algebraic number field (Q1178209) (← links)
- The complexity of computing the number of strings of given length in context-free languages (Q1178713) (← links)
- Matrix inversion in RNC\(^ 1\) (Q1179457) (← links)
- Equations for the projective closure and effective Nullstellensatz (Q1180147) (← links)
- The membership problem for unmixed polynomial ideals is solvable in single exponential time (Q1180154) (← links)
- Parallel algebraic reductions among numerical problems (Q1190636) (← links)
- NC algorithms for real algebraic numbers (Q1201334) (← links)
- Parametrization of Newton's iteration for computations with structured matrices and applications (Q1205895) (← links)
- Improved processor bounds for combinatorial problems in RNC (Q1262128) (← links)
- On the parallel complexity of the polynomial ideal membership problem (Q1271168) (← links)
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
- Specified precision polynomial root isolation is in NC (Q1329153) (← links)
- Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients (Q1351936) (← links)
- Lower bounds for diophantine approximations (Q1358914) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- The complexity of the characteristic and the minimal polynomial. (Q1401240) (← links)
- Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs (Q1404687) (← links)
- Complexity bounds in elimination theory -- a survey. (Q1565824) (← links)
- The Projective Noether Maple Package: Computing the dimension of a projective variety (Q1587230) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Polynomial bounds for invariant functions separating orbits (Q1758265) (← links)
- Weak theories of linear algebra (Q1766923) (← links)
