Pages that link to "Item:Q2341621"

The following pages link to A polynomial time approximation scheme for computing the supremum of Gaussian processes (Q2341621):

Displayed 2 items.

• Simple and efficient pseudorandom generators from gaussian processes (Q5091754) ‎ (← links)
• On the Cover Time of Dense Graphs (Q5232158) ‎ (← links)