Pages that link to "Item:Q1271174"
From MaRDI portal
The following pages link to Fast rectangular matrix multiplication and applications (Q1271174):
Displaying 50 items.
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- On minimum witnesses for Boolean matrix multiplication (Q517804) (← links)
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication (Q598219) (← links)
- All-pairs bottleneck paths in vertex weighted graphs (Q633850) (← links)
- A fast output-sensitive algorithm for Boolean matrix multiplication (Q634680) (← links)
- Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← links)
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- Modular composition via factorization (Q722764) (← links)
- Area-time tradeoff for rectangular matrix multiplication in VLSI models (Q796300) (← links)
- How to multiply matrices faster (Q799337) (← links)
- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products (Q831754) (← links)
- Dynamic matrix rank (Q843102) (← links)
- Fast dynamic transitive closure with lookahead (Q848959) (← links)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- Fast matrix multiplication is stable (Q879926) (← links)
- Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← links)
- An optimal algorithm for matrix multiplication (Q911703) (← links)
- Matrix multiplication via arithmetic progressions (Q915378) (← links)
- All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time (Q924140) (← links)
- Fast rectangular matrix multiplication and some applications (Q931517) (← links)
- Point counting in families of hyperelliptic curves (Q937277) (← links)
- Faster multi-witnesses for Boolean matrix multiplication (Q976085) (← links)
- Detecting directed 4-cycles still faster (Q1014385) (← links)
- On practical algorithms for accelerated matrix multiplication (Q1183208) (← links)
- Using fast matrix multiplication to find basic solutions (Q1275090) (← links)
- Rectangular matrix multiplication revisited (Q1361875) (← links)
- Algebraic complexity theory. II: Tast matrix multiplication and combinatorics. (Q1380697) (← links)
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
- Recognizing quasi-triangulated graphs. (Q1428566) (← links)
- Fast operations on linearized polynomials and their applications in coding theory (Q1635282) (← links)
- Are unique subgraphs not easier to find? (Q1707980) (← links)
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication (Q1799209) (← links)
- Matrix multiplication for finite algebraic systems (Q1813190) (← links)
- Fast multiplication of interval matrices (Interval version of Strassen's algorithm) (Q1826443) (← links)
- Fast rectangular matrix multiplication and QR decomposition (Q1893106) (← links)
- The matrix capacity of a tensor (Q1947657) (← links)
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets (Q2059797) (← links)
- Computing Puiseux series: a fast divide and conquer algorithm (Q2077183) (← links)
- Directed evaluation (Q2192677) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs (Q2373733) (← links)
- Efficiently correcting matrix products (Q2408920) (← links)
- Faster algorithms for all-pairs small stretch distances in weighted graphs (Q2429342) (← links)
- Fast hybrid matrix multiplication algorithms (Q2452754) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- On the complexity of matrix reduction over finite fields (Q2467342) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
