Pages that link to "Item:Q3452408"
From MaRDI portal
The following pages link to Powers of tensors and fast matrix multiplication (Q3452408):
Displaying 50 items.
- Fast likelihood calculation for multivariate Gaussian phylogenetic models with shifts (Q86833) (← links)
- A sequential regression model for big data with attributive explanatory variables (Q259121) (← links)
- On the complexity of skew arithmetic (Q260085) (← links)
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Faster geometric algorithms via dynamic determinant computation (Q283878) (← links)
- On the sizes of DPDAs, PDAs, LBAs (Q294936) (← links)
- On the nuclear norm and the singular value decomposition of tensors (Q300892) (← links)
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- Sign properties of Metzler matrices with applications (Q501264) (← links)
- A new faster algorithm for factoring skew polynomials over finite fields (Q507150) (← links)
- Efficient computation of the characteristic polynomial of a threshold graph (Q507427) (← links)
- Entanglement distillation from Greenberger-Horne-Zeilinger shares (Q525121) (← links)
- Analysis of the scheduling mechanism for virtualization of links with partial isolation (Q671150) (← links)
- Modular composition via factorization (Q722764) (← links)
- An efficient finite element solution using a large pre-solved regular element (Q726289) (← links)
- Enumeration complexity of conjunctive queries with functional dependencies (Q778529) (← links)
- Sparse regression with output correlation for cardiac ejection fraction estimation (Q781053) (← links)
- The Faddeev-LeVerrier algorithm and the Pfaffian (Q820990) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q827313) (← links)
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q831714) (← links)
- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products (Q831754) (← links)
- Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← links)
- Clustered planarity testing revisited (Q895058) (← links)
- On the complexity of integer matrix multiplication (Q1635268) (← links)
- An improved combinatorial algorithm for Boolean matrix multiplication (Q1640996) (← links)
- Equimatchable claw-free graphs (Q1660273) (← links)
- Efficient computation of tridiagonal matrices largest eigenvalue (Q1675958) (← links)
- Why does deep and cheap learning work so well? (Q1676557) (← links)
- A simple spectral algorithm for recovering planted partitions (Q1678989) (← links)
- Computing mixed volume and all mixed cells in quermassintegral time (Q1683740) (← links)
- Fast matrix multiplication by using color algebras (Q1687984) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- \(c\)-planarity of embedded cyclic \(c\)-graphs (Q1693313) (← links)
- 3D rectangulations and geometric matrix multiplication (Q1702124) (← links)
- Plethysm and fast matrix multiplication (Q1704645) (← links)
- Fast structured matrix computations: tensor rank and Cohn-Umans method (Q1704813) (← links)
- The complexity of computing all subfields of an algebraic number field (Q1733310) (← links)
- A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
- Computing the bound of an Ore polynomial. Applications to factorization (Q1757021) (← links)
- Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25 (Q1789204) (← links)
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication (Q1799209) (← links)
- Extreme witnesses and their applications (Q1799232) (← links)
- A fast algorithm for all-pairs Hamming distances (Q1799573) (← links)
- Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth (Q1989349) (← links)
- Revealed preference theory: an algorithmic outlook (Q1991199) (← links)
- Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← links)
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
- Counting invariant subspaces and decompositions of additive polynomials (Q1994893) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- On the minimum number of general or dedicated controllers required for system controllability (Q2009395) (← links)
