scientific article; zbMATH DE number 6850376

zbMath1406.65029arXiv1708.05622MaRDI QIDQ4607951

Florent Urrutia, François Le Gall

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1708.05622

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Related Items (29)

Quantum and approximation algorithms for maximum witnesses of Boolean matrix products ⋮ Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness ⋮ Computing Riemann-Roch spaces via Puiseux expansions ⋮ Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back ⋮ Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter ⋮ A faster interior-point method for sum-of-squares optimization ⋮ Improved bounds for rectangular monotone min-plus product and applications ⋮ Testing indexability and computing Whittle and Gittins index in subcubic time ⋮ Univariate polynomial factorization over finite fields with large extension degree ⋮ High-order lifting for polynomial Sylvester matrices ⋮ Finding small complete subgraphs efficiently ⋮ Bounds and algorithms for graph trusses ⋮ Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs ⋮ Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. ⋮ Improved distance sensitivity oracles with subcubic preprocessing time ⋮ Intersection graphs of non-crossing paths ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Sparse equisigned PCA: algorithms and performance bounds in the noisy rank-1 setting ⋮ Sparse matrix multiplication and triangle listing in the congested clique model ⋮ Subquadratic-time algorithms for normal bases ⋮ Unnamed Item ⋮ Hamming Distance Completeness ⋮ Limits on the Universal method for matrix multiplication ⋮ Faster Algorithms for All Pairs Non-Decreasing Paths Problem ⋮ Toward Tight Approximation Bounds for Graph Diameter and Eccentricities ⋮ Amortized multi-point evaluation of multivariate polynomials ⋮ Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles ⋮ A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix

This page was built for publication: