Pages that link to "Item:Q915378"
From MaRDI portal
The following pages link to Matrix multiplication via arithmetic progressions (Q915378):
Displaying 50 items.
- On the complexity of skew arithmetic (Q260085) (← links)
- Computing the Tutte polynomial of Archimedean tilings (Q279654) (← links)
- A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic (Q285264) (← links)
- A polynomial algorithm for the extendability problem in bipartite graphs (Q293170) (← links)
- The recognition of geodetically connected graphs (Q293190) (← links)
- Solving the all-pairs-shortest-length problem on chordal bipartite graphs (Q294620) (← links)
- Recognizing cographs and threshold graphs through a classification of their edges (Q294753) (← links)
- On the nuclear norm and the singular value decomposition of tensors (Q300892) (← links)
- Modified differential evolution with locality induced genetic operators for dynamic optimization (Q323175) (← links)
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- On the arithmetic complexity of Strassen-like matrix multiplications (Q346560) (← links)
- On sunflowers and matrix multiplication (Q354642) (← links)
- Algebraic attacks on a class of stream ciphers with unknown output function (Q369422) (← links)
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Target tracking using multiple patches and weighted vector median filters (Q385329) (← links)
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Parsing by matrix multiplication generalized to Boolean grammars (Q385966) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- The expected characteristic and permanental polynomials of the random Gram matrix (Q405292) (← links)
- A new perspective to null linear discriminant analysis method and its fast implementation using random matrix multiplication with scatter matrices (Q408033) (← links)
- Colorful triangle counting and a \textsc{MapReduce} implementation (Q413300) (← links)
- Approximate shortest paths in weighted graphs (Q414929) (← links)
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks (Q417470) (← links)
- Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
- Arboricity, \(h\)-index, and dynamic algorithms (Q418737) (← links)
- Sets of nonnegative matrices without positive products (Q426069) (← links)
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- Cover times, blanket times, and majorizing measures (Q431644) (← links)
- On efficient calculations for Bayesian variable selection (Q434881) (← links)
- Extended dynamic subgraph statistics using \(h\)-index parameterized data structures (Q443712) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- An all-pairs shortest path algorithm for bipartite graphs (Q469055) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185) (← links)
- On functional decomposition of multivariate polynomials with differentiation and homogenization (Q488898) (← links)
- A note on testing axioms of revealed preference (Q495751) (← links)
- Efficient computation of the characteristic polynomial of a threshold graph (Q507427) (← links)
- Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm (Q512336) (← links)
- On minimum witnesses for Boolean matrix multiplication (Q517804) (← links)
- Efficient computation of the characteristic polynomial of a tree and related tasks (Q528854) (← links)
- A hybrid hypercube - genetic algorithm approach for deploying many emergency response mobile units in an urban network (Q531449) (← links)
- Complexity issues for the sandwich homogeneous set problem (Q531596) (← links)
- On graphs without a \(C_{4}\) or a diamond (Q531598) (← links)
- Optimization techniques for small matrix multiplication (Q533859) (← links)
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- Using Strassen's algorithm to accelerate the solution of linear systems (Q547473) (← links)
- Computing large matchings in planar graphs with fixed minimum degree (Q553342) (← links)
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication (Q598219) (← links)
- Faster least squares approximation (Q623334) (← links)
- Small grid embeddings of 3-polytopes (Q629826) (← links)
