scientific article; zbMATH DE number 6850376

From MaRDI portal
Publication:4607951

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.


Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (29)

Quantum and approximation algorithms for maximum witnesses of Boolean matrix productsSpectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and HardnessComputing Riemann-Roch spaces via Puiseux expansionsOrthogonal range searching in moderate dimensions: k-d trees and range trees strike backSubcubic Equivalences between Graph Centrality Problems, APSP, and DiameterA faster interior-point method for sum-of-squares optimizationImproved bounds for rectangular monotone min-plus product and applicationsTesting indexability and computing Whittle and Gittins index in subcubic timeUnivariate polynomial factorization over finite fields with large extension degreeHigh-order lifting for polynomial Sylvester matricesFinding small complete subgraphs efficientlyBounds and algorithms for graph trussesImproved Time Bounds for All Pairs Non-decreasing Paths in General DigraphsImproved Distance Sensitivity Oracles with Subcubic Preprocessing Time.Improved distance sensitivity oracles with subcubic preprocessing timeIntersection graphs of non-crossing pathsUnnamed ItemUnnamed ItemSparse equisigned PCA: algorithms and performance bounds in the noisy rank-1 settingSparse matrix multiplication and triangle listing in the congested clique modelSubquadratic-time algorithms for normal basesUnnamed ItemHamming Distance CompletenessLimits on the Universal method for matrix multiplicationFaster Algorithms for All Pairs Non-Decreasing Paths ProblemToward Tight Approximation Bounds for Graph Diameter and EccentricitiesAmortized multi-point evaluation of multivariate polynomialsGraph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced CyclesA fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix




This page was built for publication: