The following pages link to (Q4542181):
Displaying 15 items.
- Faster geometric algorithms via dynamic determinant computation (Q283878) (← links)
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- The Faddeev-LeVerrier algorithm and the Pfaffian (Q820990) (← links)
- Faster combinatorial algorithms for determinant and Pfaffian (Q848938) (← links)
- The combinatorial approach yields an NC algorithm for computing Pfaffians (Q1887034) (← links)
- A simple division-free algorithm for computing determinants (Q1944204) (← links)
- Parameterized complexity of determinant and permanent (Q2207496) (← links)
- Tracy-Widom distributions for the Gaussian orthogonal and symplectic ensembles revisited: a skew-orthogonal polynomials approach (Q2227191) (← links)
- Exact, efficient, and complete arrangement computation for cubic curves (Q2507159) (← links)
- (Q3778053) (← links)
- (Q5090377) (← links)
- On the exact evaluation of spin networks (Q5410950) (← links)
- Subtraction-free complexity, cluster transformations, and spanning trees (Q5963078) (← links)
- Matchgate shadows for fermionic quantum simulation (Q6089310) (← links)
- Undirected determinant and its complexity (Q6166664) (← links)
