On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace

Dean Doron, Amnon Ta-Shma. On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace. In Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi 0001, Bettina Speckmann, editors, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I. Volume 9134 of Lecture Notes in Computer Science, pages 419-431, Springer, 2015. [doi]

Abstract

Abstract is missing.