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.
- On the minimum number of general or dedicated controllers required for system controllability (Q2009395) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation? (Q2023309) (← links)
- A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph (Q2032176) (← links)
- Subquadratic-time algorithms for normal bases (Q2040602) (← links)
- Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
- Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376) (← links)
- Computing the depth distribution of a set of boxes (Q2049979) (← links)
- The role of randomness in the broadcast congested clique model (Q2051760) (← links)
- An algebraic attack on rank metric code-based cryptosystems (Q2055648) (← links)
- Small one-dimensional Euclidean preference profiles (Q2058844) (← links)
- Rank and border rank of Kronecker powers of tensors and Strassen's laser method (Q2062866) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Subset selection for matrices with fixed blocks (Q2066125) (← links)
- Geometric adaptive Monte Carlo in random environment (Q2072631) (← links)
- Equivalent polyadic decompositions of matrix multiplication tensors (Q2074879) (← links)
- Computing Puiseux series: a fast divide and conquer algorithm (Q2077183) (← links)
- Invertible matrices over some quotient rings: identification, generation, and analysis (Q2081006) (← links)
- On the theory of dynamic graph regression problem (Q2091389) (← links)
- Polynomial modular product verification and its implications (Q2100047) (← links)
- Approximate minimum directed spanning trees under congestion (Q2117742) (← links)
- On the effect of projection on rank attacks in multivariate cryptography (Q2118528) (← links)
- Some aspects of the database resilience (Q2119956) (← links)
- Solving \((k-1)\)-stable instances of \texttt{k-terminal cut} with isolating cuts (Q2125213) (← links)
- Beyond the BEST theorem: fast assessment of Eulerian trails (Q2140495) (← links)
- Planar and toroidal morphs made easier (Q2151436) (← links)
- Bounds on complexity of matrix multiplication away from Coppersmith-Winograd tensors (Q2154275) (← links)
- Fast commutative matrix algorithms (Q2156374) (← links)
- Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems (Q2160700) (← links)
- A linear time algorithm for the nullity of vertex-weighted block graphs (Q2161234) (← links)
- On the word problem for special monoids (Q2163877) (← links)
- An introduction to the computational complexity of matrix multiplication (Q2176822) (← links)
- A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case (Q2178362) (← links)
- Simple realizability of complete abstract topological graphs simplified (Q2189738) (← links)
- Directed evaluation (Q2192677) (← links)
- Computing syzygies in finite dimension using fast linear algebra (Q2192678) (← links)
- Correlation matrices with average constraints (Q2197633) (← links)
- Algorithms for simultaneous Hermite-Padé approximations (Q2200312) (← links)
- Robust classification via MOM minimization (Q2203337) (← links)
- Lazy or eager dynamic matching may not be fast (Q2203578) (← links)
- A simple approach to nondecreasing paths (Q2203587) (← links)
- Parameterized complexity of determinant and permanent (Q2207496) (← links)
- Efficient algorithms for solving the \(p\)-Laplacian in polynomial time (Q2209522) (← links)
- First-order definitions of subgraph isomorphism through the adjacency and order relations (Q2211263) (← links)
- Solutions for subset sum problems with special digraph constraints (Q2216192) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Representations of torsion-free arithmetic matroids (Q2225454) (← links)
- Towards a geometric approach to Strassen's asymptotic rank conjecture (Q2228323) (← links)
- New ways to multiply \(3 \times 3\)-matrices (Q2229749) (← links)
- Work-sensitive dynamic complexity of formal languages (Q2233429) (← links)
