Pages that link to "Item:Q6645500"
From MaRDI portal
The following pages link to New bounds for matrix multiplication: from alpha to omega (Q6645500):
Displaying 13 items.
- Pivot Gray codes for the spanning trees of a graph ft. the fan (Q6580496) (← links)
- A refined laser method and faster matrix multiplication (Q6601301) (← links)
- Leanness computation: small values and special graph classes (Q6606996) (← links)
- Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication (Q6614108) (← links)
- Interpolation by decomposable univariate polynomials (Q6614422) (← links)
- Topological fingerprints for audio identification (Q6617273) (← links)
- The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds (Q6633271) (← links)
- Domination polynomials of the grid, the cylinder, the torus, and the king graph (Q6635586) (← links)
- Complex matrix inversion via real matrix inversions (Q6644044) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)
- Finding and counting small tournaments in large tournaments (Q6652454) (← links)
- Intersection of chordal graphs and some related partition problems (Q6657232) (← links)
- A new fast root-finder for black box polynomials (Q6658315) (← links)