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):
Displayed 40 items.
- 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)
- 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)
- (Q5091009) (← links)
- On the complexity of computing the greatest common divisor of several univariate polynomials (Q5096342) (← links)
- (Q5121907) (← links)
- COMPUTATION OF A DETERMINANT AND A MATRIX PRODUCT IN CELLULAR AUTOMATA (Q5151295) (← links)
- Short Proofs for the Determinant Identities (Q5252690) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- Computing characteristic polynomials of matrices of structured polynomials (Q5268829) (← links)
- Algebraic independence in positive characteristic: A $p$-adic calculus (Q5420121) (← links)
- ON THE MINIMAL POLYNOMIAL OF A MATRIX (Q5696967) (← links)
- Division-free computation of subresultants using Bezout matrices (Q5850765) (← links)
- A Gröbner free alternative for polynomial system solving (Q5938584) (← links)
- Computing bases of complete intersection rings in Noether position (Q5946450) (← links)
- Connections between graphs and matrix spaces (Q6074039) (← links)
- ABE for circuits with constant-size secret keys and adaptive security (Q6114257) (← links)
- Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)
