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)
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- Modular composition via factorization (Q722764) (← 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)
- Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← 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)
- 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)
- 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 computation of special resultants (Q2457312) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Unique subgraphs are not easier to find (Q2855752) (← links)
- Taking roots over high extensions of finite fields (Q2862538) (← links)
- A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs (Q2891383) (← links)
- On design of circuits of logarithmic depth for inversion in finite fields (Q3184560) (← links)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- A Path Cover Technique for LCAs in Dags (Q3512461) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- Dominance Product and High-Dimensional Closest Pair under L_infty (Q5136258) (← links)
- The Closest Pair Problem under the Hamming Metric (Q5323065) (← links)
- On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other (Q5439060) (← links)
- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs (Q5458845) (← links)
- A fast algorithm for reversion of power series (Q5497035) (← links)
- A fully dynamic algorithm for maintaining the transitive closure (Q5917499) (← links)
- Rare siblings speed-up deterministic detection and counting of small pattern graphs (Q5925690) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
