Pages that link to "Item:Q5415522"
From MaRDI portal
The following pages link to Multiplying matrices faster than coppersmith-winograd (Q5415522):
Displaying 50 items.
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings (Q266919) (← links)
- Polly cracker, revisited (Q285245) (← links)
- On the nuclear norm and the singular value decomposition of tensors (Q300892) (← links)
- Deterministic parameterized algorithms for the graph motif problem (Q313814) (← links)
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- Triangle counting in dynamic graph streams (Q334947) (← links)
- Structure of squares and efficient domination in graph classes (Q338382) (← links)
- On the arithmetic complexity of Strassen-like matrix multiplications (Q346560) (← links)
- On sunflowers and matrix multiplication (Q354642) (← links)
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Parsing by matrix multiplication generalized to Boolean grammars (Q385966) (← links)
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs (Q391971) (← links)
- The number of Euler tours of random directed graphs (Q396813) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- Mutually unbiased weighing matrices (Q498976) (← links)
- Efficient computation of the characteristic polynomial of a threshold graph (Q507427) (← links)
- Numerical CP decomposition of some difficult tensors (Q508007) (← links)
- Further remarks on DNA overlap assembly (Q515580) (← links)
- On minimum witnesses for Boolean matrix multiplication (Q517804) (← links)
- Parsing Boolean grammars over a one-letter alphabet using online convolution (Q714852) (← 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)
- Improvements to the deformation method for counting points on smooth projective hypersurfaces (Q895704) (← links)
- Computing the Fréchet distance between folded polygons (Q904083) (← links)
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
- Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
- An improved combinatorial algorithm for Boolean matrix multiplication (Q1640996) (← links)
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane (Q1651693) (← links)
- Finding even subgraphs even faster (Q1671994) (← links)
- Computing mixed volume and all mixed cells in quermassintegral time (Q1683740) (← links)
- \(c\)-planarity of embedded cyclic \(c\)-graphs (Q1693313) (← links)
- Plethysm and fast matrix multiplication (Q1704645) (← links)
- Fast structured matrix computations: tensor rank and Cohn-Umans method (Q1704813) (← links)
- Clifford algebras meet tree decompositions (Q1725639) (← links)
- Efficient algorithms for subgraph listing (Q1736617) (← links)
- A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
- Inverse linear difference operators (Q1746360) (← links)
- A \(\min\)-\(\max\) relation in flowgraphs and some applications (Q1752483) (← links)
- Extreme witnesses and their applications (Q1799232) (← links)
- A review of two network curvature measures (Q1982207) (← links)
- Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth (Q1989349) (← links)
- Revealed preference theory: an algorithmic outlook (Q1991199) (← links)
- Caps and progression-free sets in \(\mathbb{Z}_m^n\) (Q2004972) (← links)
- Gaussian variant of Freivalds' algorithm for efficient and reliable matrix product verification (Q2026637) (← links)
- Path querying on acyclic graphs using Boolean grammars (Q2027852) (← links)
