@InProceedings{levi_et_al:LIPIcs.APPROX-RANDOM.2018.17,
author = {Levi, Amit and Yoshida, Yuichi},
title = {{Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {17:1--17:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.17},
URN = {urn:nbn:de:0030-drops-94210},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.17},
annote = {Keywords: Qudratic function minimization, Approximation Algorithms, Matrix spectral decomposition, Graph limits}
}