A polynomial time approximation scheme for computing the supremum of Gaussian processes (Q2341621): Difference between revisions

@@ Property / cites work @@
+Q2760170
@@ Property / cites work: Q2760170 / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees
+Normal rank
@@ Property / cites work @@
+Cover times, blanket times, and majorizing measures
+Normal rank
@@ Property / cites work @@
+Q4829005
@@ Property / cites work: Q4829005 / rank @@
+Normal rank
@@ Property / cites work @@
+Unimodality and Dominance For Symmetric Random Vectors
+Normal rank
@@ Property / cites work @@
+Q3997990
@@ Property / cites work: Q3997990 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4878667
@@ Property / cites work: Q4878667 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4254915
@@ Property / cites work: Q4254915 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic derandomization via complexity theory
@@ Property / cites work: Algorithmic derandomization via complexity theory / rank @@
+Normal rank
@@ Property / cites work @@
+The Generic Chaining
@@ Property / cites work: The Generic Chaining / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple cover time
@@ Property / cites work: Multiple cover time / rank @@
+Normal rank