A polynomial time approximation scheme for computing the supremum of Gaussian processes (Q2341621)
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: A polynomial time approximation scheme for computing the supremum of Gaussian processes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time approximation scheme for computing the supremum of Gaussian processes |
scientific article |
Statements
A polynomial time approximation scheme for computing the supremum of Gaussian processes (English)
0 references
27 April 2015
0 references
Gaussian processes
0 references
derandomization
0 references
cover time
0 references
random walks
0 references
\(\varepsilon\)-nets
0 references
