On the problem of approximating the eigenvalues of undirected graphs in probabilistic logspace (Q3448804)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the problem of approximating the eigenvalues of undirected graphs in probabilistic logspace |
scientific article; zbMATH DE number 6498661
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the problem of approximating the eigenvalues of undirected graphs in probabilistic logspace |
scientific article; zbMATH DE number 6498661 |
Statements
On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace (English)
0 references
27 October 2015
0 references
0.8624433279037476
0 references
0.7617254853248596
0 references
0.715445876121521
0 references
0.7069264054298401
0 references
0.7039740085601807
0 references
