Faster Algorithms via Approximation Theory

DOI10.1561/0400000065zbMath1333.68296arXiv1309.4882OpenAlexW2064769982MaRDI QIDQ5167553

Sushant Sachdeva, Nisheeth K. Vishnoi

Publication date: 10 July 2014

Published in: Foundations and Trends® in Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

combinatoricsgraph theoryspectral methodsdesign and analysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Approximation by rational functions (41A20) Approximation by polynomials (41A10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Approximation algorithms (68W25)

Related Items (5)

Dynamic study of Schröder's families of first and second kind ⋮ Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision ⋮ Efficient quantum algorithms for state measurement and linear algebra applications ⋮ Approximate Degree, Secret Sharing, and Concentration Phenomena ⋮ Graph Powering and Spectral Robustness

This page was built for publication: Faster Algorithms via Approximation Theory