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.
- Deterministic polynomial identity testing in non-commutative models (Q1781113) (← links)
- Fast and efficient parallel solution of dense linear systems (Q1825589) (← links)
- The proof complexity of linear algebra (Q1886325) (← links)
- Randomization and the parallel solution of linear algebra problems (Q1905899) (← links)
- Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties (Q1928235) (← links)
- Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704) (← links)
- On arithmetic branching programs (Q1961372) (← links)
- Deformation techniques for efficient polynomial equation solving. (Q1977143) (← links)
- Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
- Linear matroid intersection is in quasi-NC (Q2027206) (← links)
- Factorization of polynomials given by arithmetic branching programs (Q2051373) (← links)
- On the hardness of the determinant: sum of regular set-multilinear circuits (Q2140523) (← links)
- On Hosoya's dormants and sprouts (Q2148009) (← links)
- Directed evaluation (Q2192677) (← links)
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q2204092) (← links)
- Computation of étale cohomology on curves in single exponential time (Q2211019) (← links)
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- On the structure of loop-free non-negative edge-bipartite graphs (Q2272490) (← links)
- Operator scaling: theory and applications (Q2309517) (← links)
- Generalized Wong sequences and their applications to Edmonds' problems (Q2353409) (← links)
- Algorithmic aspects of Suslin's proof of Serre's conjecture (Q2366722) (← links)
- On the efficiency of effective Nullstellensätze (Q2366723) (← links)
- Change of order for regular chains in positive dimension (Q2476011) (← links)
- Characterizing Valiant's algebraic complexity classes (Q2479314) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation (Q2680117) (← links)
- Homomorphic Evaluation Requires Depth (Q2796133) (← links)
- Arithmetic Circuits: A Chasm at Depth 3 (Q2816300) (← links)
- Computing Characteristic Polynomials of Matrices of Structured Polynomials (Q2830011) (← links)
- Bounded Treewidth and Space-Efficient Linear Algebra (Q2948475) (← links)
- Calculation of the characteristic polynomial of a matrix (Q3008828) (← links)
- Lower Bounds for Syntactically Multilinear Algebraic Branching Programs (Q3599145) (← links)
- Structure and importance of logspace-MOD class (Q4009813) (← links)
- Automatic Symbolic Computation for Discontinuous Galerkin Finite Element Methods (Q4568094) (← links)
- (Q4612482) (← links)
- Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic (Q4630279) (← links)
- (Q4637752) (← links)
- Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor (Q4652743) (← links)
- Sur la complexité du principe de Tarski-Seidenberg (Q4713865) (← links)
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
- Relationships among $PL$, $\#L$, and the determinant (Q4889814) (← links)
- Fast parallel algorithms for vandermonde determinants (Q4950623) (← links)
- Notes on Hazard-Free Circuits (Q4986809) (← links)
- A Complete Characterization of Unitary Quantum Space (Q4993267) (← links)
- From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces (Q4994986) (← links)
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- (Q5002644) (← links)
- Determinant: Old algorithms, new insights (Q5054863) (← links)
- (Q5090377) (← links)
