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 21 items.
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- Probabilistic logarithmic-space algorithms for Laplacian solvers (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)
- Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)
- Bounded length UCFG equivalence (Q6487444) (← links)
- Determinants vs. algebraic branching programs (Q6624427) (← links)
- A general framework for lattice-based ABE using evasive inner-product functional encryption (Q6636517) (← links)
