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

Autor:	Amnon Ta-Shma, Dean Doron
Rok vydání:	2015
Předmět:	Discrete mathematics Computer science Computation MathematicsofComputing_NUMERICALANALYSIS Probabilistic logic Symmetric matrix Context (language use) Undirected graph Eigenvalues and eigenvectors
Zdroj:	Automata, Languages, and Programming ISBN: 9783662476710 ICALP (1)
DOI:	10.1007/978-3-662-47672-7_34
Popis:	We introduce the problem of approximating the eigenvalues of a given stochastic/symmetric matrix in the context of classical space-bounded computation.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::5c0a45e920c0c1e7429eaddecd9a3ed8 https://doi.org/10.1007/978-3-662-47672-7_34 Zobrazit plný text záznamu