A polynomial time approximation scheme for computing the supremum of Gaussian processes (Q2341621): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:15, 2 February 2024
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
