Matrix multiplication via arithmetic progressions
From MaRDI portal
Publication:915378
DOI10.1016/S0747-7171(08)80013-2zbMath0702.65046WikidataQ29036525 ScholiaQ29036525MaRDI QIDQ915378
Don Coppersmith, Shmuel Winograd
Publication date: 1990
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Related Items
Labeled shortest paths in digraphs with negative and positive edge weights, The Closest Pair Problem under the Hamming Metric, Unnamed Item, Unnamed Item, Scalable semiparametric spatio-temporal regression for large data analysis, Skew-polynomial-sparse matrix multiplication, Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter, Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation, The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\), Faster possibility detection by combining two approaches, Pebbling Game and Alternative Basis for High Performance Matrix Multiplication, A structure-preserving, upwind-SAV scheme for the degenerate Cahn-Hilliard equation with applications to simulating surface diffusion, Perturbation theory for evolution of cooperation on networks, Neural networks for scalar input and functional output, Concise tensors of minimal border rank, Sub-cubic cost algorithms for the all pairs shortest path problem, Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity, Towards a Gröbner-free approach to coding, Theta nullvalues of supersingular abelian varieties, Irreversibility of structure tensors of modules, Verifying the product of generalized Boolean matrix multiplication and its applications to detect small subgraphs, Finding small complete subgraphs efficiently, Locating Eigenvalues of Symmetric Matrices - A Survey, An Optimal Algorithm for Finding Frieze–Kannan Regular Partitions, On Regularity Lemmas and their Algorithmic Applications, Unnamed Item, Unnamed Item, Structural Intervention Distance for Evaluating Causal Graphs, Side Channel Attacks on Irregularly Decimated Generators, Faster Combinatorial Algorithms for Determinant and Pfaffian, A Rank 18 Waring Decomposition of sM〈3〉 with 432 Symmetries, Factoring polynomials over finite fields: A survey, Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation, Asymptotic entanglement transformation between W and GHZ states, Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\), Parallel output-sensitive algorithms for combinatorial and linear algebra problems, Unnamed Item, A fully dynamic algorithm for maintaining the transitive closure, A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs, Limits on the Universal method for matrix multiplication, Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems, Barriers for fast matrix multiplication from irreversibility, A hierarchical discretized-parameter polynomial adaptive estimator for non-linearly parameterized systems, Computation of polarized metrized graph invariants by using discrete Laplacian matrix, Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses, Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones, Division-free computation of subresultants using Bezout matrices, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Parallel algorithms for matroid intersection and matroid parity, Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication, A quantum interior-point predictor–corrector algorithm for linear programming, Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm, On claw-free asteroidal triple-free graphs, Computing matrix-valued Nevanlinna-Pick interpolation, Halfspace learning, linear programming, and nonmalicious distributions, On the parallel complexity of digraph reachability, Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity, On the complexity of integer matrix multiplication, Fast operations on linearized polynomials and their applications in coding theory, Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems, All pairs shortest paths for graphs with small integer length edges, On the exponent of all pairs shortest path problem, An algorithm for autonomously plotting solution sets in the presence of turning points, The input/output complexity of transitive closure, Rectangular matrix multiplication revisited, Semi-algebraic complexity -- Additive complexity of matrix computational tasks, Factor base discrete logarithms in Kummer extensions, Parallel evaluation of arithmetic circuits, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, Some efficient computational algorithms related to phase models, A greedy algorithm for the optimal basis problem, Segment LLL reduction of lattice bases using modular arithmetic, Matrix structures in parallel matrix computations, Efficient approximate solution of sparse linear systems, A tight bound for Green's arithmetic triangle removal lemma in vector spaces, Minimum cycle bases of weighted outerplanar graphs, Pushdown reachability with constant treewidth, Efficient computation of tridiagonal matrices largest eigenvalue, Parameterized circuit complexity and the \(W\) hierarchy, Size-estimation framework with applications to transitive closure and reachability, The bulk-synchronous parallel random access machine, A simple spectral algorithm for recovering planted partitions, Tensor decomposition and homotopy continuation, On the complexity of the multiplication of matrices of small formats, Fast matrix multiplication by using color algebras, Accelerating Viterbi algorithm on graphics processing units, Plethysm and fast matrix multiplication, Fast structured matrix computations: tensor rank and Cohn-Umans method, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., Recognizing quasi-triangulated graphs., Finding large 3-free sets. I. The small \(n\) case, Two dimensional aggregation procedure: An alternative to the matrix algebraic algorithm, Mantaining dynamic matrices for fully dynamic transitive closure, Fast rectangular matrix multiplication and some applications, Computing dominances in \(E^ n\), Computing the Fréchet distance between simple polygons, An implicit algorithm for validated enclosures of the solutions to variational equations for ODEs, Cycle-free partial orders and chordal comparability graphs, Transitive closure for restricted classes of partial orders, Efficient algorithms for subgraph listing, Locally linear reconstruction for instance-based learning, A new characterization of HH-free graphs, Efficient parallel algorithms for path problems in directed graphs, Inverse linear difference operators, Dense community detection in multi-valued attributed networks, Solving structured linear systems with large displacement rank, Main-memory triangle computations for very large (sparse (power-law)) graphs, Exact algorithms for exact satisfiability and number of perfect matchings, Decision problem for shuffled genes, NC algorithms for real algebraic numbers, Testing isomorphism of modules., Fast change of basis in algebras, Fast multiplication of matrices over a finitely generated semiring, Parametrization of Newton's iteration for computations with structured matrices and applications, Finding the longest isometric cycle in a graph, Randomized preprocessing of homogeneous linear systems of equations, Entropy of operators or why matrix multiplication is hard for depth-two circuits, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Beyond the Alder-Strassen bound., Faster multi-witnesses for Boolean matrix multiplication, Efficient algorithms for clique problems, On sign conditions over real multivariate polynomials, Newton's method and FFT trading, A note on compressed sensing and the complexity of matrix multiplication, Solving path problems on the GPU, Three-coloring and list three-coloring of graphs without induced paths on seven vertices, All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time, An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs, Probabilistic algorithm for finding roots of linearized polynomials, Improved processor bounds for combinatorial problems in RNC, Detecting directed 4-cycles still faster, Dynamic connectivity for axis-parallel rectangles, Fast neighbor joining, TAL recognition in \(O(M(n^2))\) time, Fast rectangular matrix multiplication and applications, Using fast matrix multiplication to find basic solutions, Generalized matrix inversion is not harder than matrix multiplication, Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem, Maximum weight bipartite matching in matrix multiplication time, Homogeneous 2-hop broadcast in 2D, A selected tour of the theory of identification matrices, Computational study on planar dominating set problem, Why does information-based complexity use the real number model?, Algorithms for generating convex sets in acyclic digraphs, Recognizing clique graphs of directed and rooted path graphs, Algorithms for exponentiation in finite fields, FFT-like multiplication of linear differential operators, Bounds on sample space size for matrix product verification, Locating service centers with precedence constraints, A technique for speeding up the solution of the Lagrangean dual, Optimal gray-code labeling and recognition algorithms for hypercubes, Self-testing/correcting with applications to numerical problems, Minimal triangulations of graphs: a survey, Minimal fill in O(\(n^{2.69}\)) time, Stochastic semidiscretization method: second moment stability analysis of linear stochastic periodic dynamical systems with delays, Computing the Tutte polynomial of Archimedean tilings, A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic, Speeding up HMM decoding and training by exploiting sequence repetitions, A polynomial algorithm for the extendability problem in bipartite graphs, The recognition of geodetically connected graphs, Solving the all-pairs-shortest-length problem on chordal bipartite graphs, Recognizing cographs and threshold graphs through a classification of their edges, Reconstruction of graphs based on random walks, On the nuclear norm and the singular value decomposition of tensors, Efficient enumeration of words in regular languages, Dynamic matrix rank, Optimal 2-constraint satisfaction via sum-product algorithms, Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs, On transitive orientations with restricted covering graphs, Novel scheduling strategy for downlink multiuser MIMO system: Particle swarm optimization, Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time, An algorithm for minimum cost arc-connectivity orientations, Faster combinatorial algorithms for determinant and Pfaffian, Fast dynamic transitive closure with lookahead, Dynamic shortest paths and transitive closure: algorithmic techniques and data structures, Modified differential evolution with locality induced genetic operators for dynamic optimization, Improving quantum query complexity of Boolean matrix multiplication using graph collision, Strong computational lower bounds via parameterized complexity, Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs, On the arithmetic complexity of Strassen-like matrix multiplications, On sunflowers and matrix multiplication, Triangulated neighborhoods in even-hole-free graphs, The aggregation and cancellation techniques as a practical tool for faster matrix multiplication, Algebraic attacks on a class of stream ciphers with unknown output function, Modular composition modulo triangular sets and applications, Fast matrix multiplication is stable, Alternating paths along axis-parallel segments, Target tracking using multiple patches and weighted vector median filters, On enumerating monomials and other combinatorial structures by polynomial interpolation, Parsing by matrix multiplication generalized to Boolean grammars, Induced subgraph isomorphism: are some patterns substantially easier than others?, Conjunctive and Boolean grammars: the true general case of the context-free grammars, On the approximate bilinear complexity of matrix multiplication, The expected characteristic and permanental polynomials of the random Gram matrix, A new perspective to null linear discriminant analysis method and its fast implementation using random matrix multiplication with scatter matrices, Computation of differential Chow forms for ordinary prime differential ideals, Faster least squares approximation, On low tree-depth decompositions, Colorful triangle counting and a \textsc{MapReduce} implementation, Average-case complexity of the min-sum matrix product problem, Approximate shortest paths in weighted graphs, Structural control of single-input rank one bilinear systems, Path Laplacian matrices: introduction and application to the analysis of consensus in networks, Some results on approximate 1-median selection in metric spaces, Arboricity, \(h\)-index, and dynamic algorithms, Small grid embeddings of 3-polytopes, Generalized transfer subspace learning through low-rank constraint, Sets of nonnegative matrices without positive products, New approximation algorithms for minimum cycle bases of graphs, All-pairs bottleneck paths in vertex weighted graphs, Complexity bounds for the rational Newton-Puiseux algorithm over finite fields, A fast output-sensitive algorithm for Boolean matrix multiplication, Cover times, blanket times, and majorizing measures, On efficient calculations for Bayesian variable selection, Linear solving for sign determination, On dynamic shortest paths problems, Extended dynamic subgraph statistics using \(h\)-index parameterized data structures, Combinatorial and computational aspects of graph packing and graph decomposition, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time, Partitioned probe comparability graphs, An all-pairs shortest path algorithm for bipartite graphs, Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization, Relaxed Hensel lifting of triangular sets, On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices, On functional decomposition of multivariate polynomials with differentiation and homogenization, A note on testing axioms of revealed preference, Counting curves and their projections, Efficient computation of the characteristic polynomial of a threshold graph, Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm, The double pivot simplex method, On minimum witnesses for Boolean matrix multiplication, Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs, Some computational problems in linear algebra as hard as matrix multiplication, Efficient computation of the characteristic polynomial of a tree and related tasks, A hybrid hypercube - genetic algorithm approach for deploying many emergency response mobile units in an urban network, Complexity issues for the sandwich homogeneous set problem, On graphs without a \(C_{4}\) or a diamond, Optimization techniques for small matrix multiplication, Selected topics on assignment problems, Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation, Using Strassen's algorithm to accelerate the solution of linear systems, Weak minimization of DFA -- an algorithm and applications, On the complexity of fixed parameter clique and dominating set, Computing large matchings in planar graphs with fixed minimum degree, Parsing Boolean grammars over a one-letter alphabet using online convolution, An efficient finite element solution using a large pre-solved regular element, Cycle bases of graphs and sampled manifolds, Information-based complexity: New questions for mathematicians, The asymptotic induced matching number of hypergraphs: balanced binary strings, Point algebras for temporal reasoning: Algorithms and complexity, On the complexity of skew arithmetic, Universal points in the asymptotic spectrum of tensors, A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs, Fast parallel constraint satisfaction, AN EFFICIENT ALGORITHM FOR DERIVING SUMMATION IDENTITIES FROM MUTUAL RECURRENCES, Low-Rank Transfer Learning, Computing minimal interpolation bases, Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs, A survey of the all-pairs shortest paths problem and its variants in graphs, Efficient Computation of the Characteristic Polynomial of a Threshold Graph, Fast Output-Sensitive Matrix Multiplication, BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES, Unnamed Item, The Subrank of a Complex Symmetric Tensor Can Exceed its Symmetric Subrank, ALGORITHMS TO IDENTIFY ABUNDANTp-SINGULAR ELEMENTS IN FINITE CLASSICAL GROUPS, The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics, Resolving Loads with Positive Interior Stresses, Constructing normal bases in finite fields, DISCOVERING ROBUST EMBEDDINGS IN (DIS)SIMILARITY SPACE FOR HIGH-DIMENSIONAL LINGUISTIC FEATURES, GENERATION OF STATIONARY CONTROL POLICIES WITH BEST EXPECTED PERFORMANCE FOR A FAMILY OF MARKOV CHAINS, Quantum machine learning: a classical perspective, A survey on the linear ordering problem for weighted or unweighted tournaments, PARALLEL APPROXIMATE MATCHING, Spectral Discovery of Jointly Smooth Features for Multimodal Data, New applications of the polynomial method: The cap set conjecture and beyond, Maximal and Maximum Transitive Relation Contained in a Given Binary Relation, Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems, On the tensor rank of $3\times 3$ permanent and determinant, Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps, The bilinear complexity and practical algorithms for matrix multiplication, Control of ellipsoidal trajectories: Theory and numerical results, Efficiently Correcting Matrix Products, Unnamed Item, Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science, Geometry and the complexity of matrix multiplication, Unnamed Item, A linear algebraic approach to datalog evaluation, Efficient Enumeration of Regular Languages, A Superquadratic Variant of Newton's Method, Efficient Disjointness Tests for Private Datasets, A Path Cover Technique for LCAs in Dags, Unnamed Item, Fast matrix multiplication and its algebraic neighbourhood, Growth Functions and Automatic Groups, Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model, On the Minimisation of Acyclic Models, Further Limitations of the Known Approaches for Matrix Multiplication, On Faster Integer Calculations Using Non-arithmetic Primitives, Computational Complexity of SRIC and LRIC Indices, Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs., Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time, A family of trapdoor ciphers, Recognizing Sparse Perfect Elimination Bipartite Graphs, Algebraic Attacks on the Courtois Toy Cipher, Some algorithms related to matrices with entries in a finite field, On cap sets and the group-theoretic approach to matrix multiplication, How to use the minimal separators of a graph for its chordal triangulation, On optimizing multiplications of sparse matrices, Subquadratic-time factoring of polynomials over finite fields, Fast and scalable parallel matrix computations with reconfigurable pipelined optical buses, Theory of computational complexity. Part 9. Transl. from the Russian., Asymptotically fast group operations on Jacobians of general curves, Fully dynamic all pairs shortest paths with real edge weights, Disjoint clique cutsets in graphs without long holes, Unnamed Item, Unnamed Item, Unnamed Item, Approximating Shortest Paths in Graphs, QUANTUM CORNER — TRANSFER MATRIX DMRG, A Rigorous Subexponential Algorithm For Computation of Class Groups, Fast matrix decomposition in \(\mathbb F_2\), Efficient finite element solution of regular and near-regular systems using graph products, The border rank of the multiplication of $2\times 2$ matrices is seven, Counting Spanning Trees in Graphs Using Modular Decomposition, Efficient Computation of the Fourier Transform on Finite Groups, MEMORY EFFICIENT HYPERELLIPTIC CURVE POINT COUNTING, A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives, A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma, Point Counting in Families of Hyperelliptic Curves in Characteristic 2, An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs, Upgrading Subgroup Triple-Product-Property Triples, On the Differential and Full Algebraic Complexities of Operator Matrices Transformations, On Multiple Eigenvalues of a Matrix Dependent on a Parameter, Border Rank Nonadditivity for Higher Order Tensors, Tripartite Entanglement Transformations and Tensor Rank, Efficient computation in rational-valued P systems, Partitioning into Sets of Bounded Cardinality, Tight lower bounds for certain parameterized NP-hard problems, Acyclic Digraphs, On the reduction of total‐cost and average‐cost MDPs to discounted MDPs, Accelerated multiple precision matrix multiplication using Strassen's algorithm and Winograd's variant, Performance evaluation of multiple precision matrix multiplications using parallelized Strassen and Winograd algorithms, Parameterized computation and complexity: a new approach dealing with NP-hardness, Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules., Taking roots over high extensions of finite fields, A new algorithm for optimal 2-constraint satisfaction and its implications, Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication, A Complete Implementation for Computing General Dimensional Convex Hulls, Scheduling multiprocessor tasks on two parallel processors, Linear algebra over and related rings, Application of the companion factorization to linear non-autonomous area-preserving maps, A note on VNP-completeness and border complexity, Fast computation of discrete invariants associated to a differential rational mapping, Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs, Computing Frobenius maps and factoring polynomials, Efficient transitive closure of sparse matrices over closed semirings, Maximum matchings in planar graphs via Gaussian elimination, Boolean grammars, Learning functions of \(k\) relevant variables, Faster algorithms for finding lowest common ancestors in directed acyclic graphs, An efficient parallel algorithm for finding rectangular duals of plane triangular graphs, On interval decomposability of \(2\)D persistence modules, The matrix reloaded: multiplication strategies in FrodoKEM, A local approach to concept generation, The shifted number system for fast linear algebra on integer matrices, Bounds on complexity of matrix multiplication away from Coppersmith-Winograd tensors, Fast commutative matrix algorithms, External matrix multiplication and all-pairs shortest path, Topological persistence for circle-valued maps, Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems, Abelian tensors, On the geometry of geometric rank, A new algorithm for minimizing convex functions over convex sets, An introduction to the computational complexity of matrix multiplication, A cutting plane algorithm for convex programming that uses analytic centers, Efficiently correcting matrix products, Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions, A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case, Sunflowers and testing triangle-freeness of functions, Data science applications to string theory, Tensor surgery and tensor rank, Asymptotic tensor rank of graph tensors: beyond matrix multiplication, Computing syzygies in finite dimension using fast linear algebra, Randomized preprocessing versus pivoting, Additive preconditioning and aggregation in matrix computations, Grad and classes with bounded expansion. II: Algorithmic aspects, Complexity of finding graph roots with girth conditions, A shortest cycle for each vertex of a graph, Almost exact matchings, Algorithms for simultaneous Hermite-Padé approximations, The matrix capacity of a tensor, Multiplication matrices and ideals of projective dimension zero, Parameterized complexity of determinant and permanent, HPMaX: heterogeneous parallel matrix multiplication using CPUs and GPUs, A note on the multiplication of sparse matrices, Bisimplicial edges in bipartite graphs, Complexity of the path avoiding forbidden pairs problem revisited, Optimal computation of shortest paths on doubly convex bipartite graphs, PageRank optimization by edge selection, Analyzing the positivity preservation of numerical methods for the Liouville-von Neumann equation, Fast hybrid matrix multiplication algorithms, A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine, Towards a geometric approach to Strassen's asymptotic rank conjecture, Fast computation of special resultants, Efficient decomposition of associative algebras over finite fields, Fast linear algebra is stable, New applications of the incompressibility method. II, Processor efficient parallel matching, Revealed preference theory: an algorithmic outlook, Fast bilinear algorithms for symmetric tensor contractions, Open problems around exact algorithms, Verification protocols with sub-linear communication for polynomial matrix operations, Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields, A segregated approach for modeling the electrochemistry in the 3-D microstructure of li-ion batteries and its acceleration using block preconditioners, All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time, Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation, Convolution accelerator designs using fast algorithms, Caps and progression-free sets in \(\mathbb{Z}_m^n\), An optimized differential step-size LMS algorithm, Efficient parallel factorization and solution of structured and unstructured linear systems, Applying modular decomposition to parameterized cluster editing problems, Improved method for finding optimal formulas for bilinear maps in a finite field, Vertex splitting and the recognition of trapezoid graphs, The singularity attack to the multivariate signature scheme HIMQ-3, Improving connectivity of compromised digital networks via algebraic connectivity maximisation, Optimisation of complex integration contours at higher order, Fast computation of approximant bases in canonical form, Large margin vs. large volume in transductive learning, Sparse matrix multiplication and triangle listing in the congested clique model, A fast algorithm for all-pairs Hamming distances, Solving degenerate sparse polynomial systems faster, Computing Hermite and Smith normal forms of triangular integer matrices, Analysis of the shortest relay queue policy in a cooperative random access network with collisions, Recognition of some perfectly orderable graph classes, Rank and border rank of Kronecker powers of tensors and Strassen's laser method, Practical complexities of probabilistic algorithms for solving Boolean polynomial systems, A graph clustering approach to localization for adaptive covariance tuning in data assimilation based on state-observation mapping, Exact and approximation algorithms for weighted matroid intersection, Generalized penalty for circular coordinate representation, Consequences of an algorithm for bridged graphs, Almost all subgeneric third-order Chow decompositions are identifiable, Grothendieck constant is norm of Strassen matrix multiplication tensor, Secure linear system computation in the presence of malicious adversaries, On computing the diameter of a point set in high dimensional Euclidean space., On the descriptive and algorithmic power of parity ordered binary decision diagrams, On the complexity of the \(F_5\) Gröbner basis algorithm, Bounds on the disparity and separation of tournament solutions, Unifying known lower bounds via geometric complexity theory, Lower bounds for testing triangle-freeness in Boolean functions, A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices, A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis
Cites Work
