A polynomial time approximation scheme for computing the supremum of Gaussian processes (Q2341621): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1202.4970 / rank | |||
Normal rank | |||
Revision as of 04:26, 19 April 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
