Pages that link to "Item:Q4699172"
From MaRDI portal
The following pages link to Determinant: Old Algorithms, New Insights (Q4699172):
Displaying 13 items.
- Faster combinatorial algorithms for determinant and Pfaffian (Q848938) (← links)
- The quantum query complexity of the determinant (Q976107) (← links)
- The complexity of the characteristic and the minimal polynomial. (Q1401240) (← links)
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. (Q1426727) (← links)
- Functional programming concepts and straight-line programs in computer algebra (Q1849848) (← links)
- Counting the number of perfect matchings, and generalized decision trees (Q2044128) (← links)
- Factorization of polynomials given by arithmetic branching programs (Q2051373) (← links)
- Noncommutativity makes determinants hard (Q2347802) (← links)
- On the linear classification of even and odd permutation matrices and the complexity of computing the permanent (Q2359079) (← links)
- (Q5002805) (← links)
- Factorization of polynomials given by arithmetic branching programs (Q5092484) (← links)
- On the exact evaluation of spin networks (Q5410950) (← links)
- Weighted sum-of-squares lower bounds for univariate polynomials imply \(\mathsf{VP} \neq \mathsf{VNP}\) (Q6542431) (← links)
