A random polynomial time algorithm for well-routing convex bodies (Q1805452): Difference between revisions

@@ Property / author @@
-Noud Gademann
@@ Property / author: Noud Gademann / rank @@
-Normal rank
@@ Property / author @@
-Walter Kern
@@ Property / author: Walter Kern / rank @@
-Normal rank
@@ Property / author @@
+Noud Gademann
@@ Property / author: Noud Gademann / rank @@
+Normal rank
@@ Property / author @@
+Walter Kern
@@ Property / author: Walter Kern / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing
+Normal rank
@@ Property / cites work @@
+Shuffling Cards and Stopping Times
@@ Property / cites work: Shuffling Cards and Stopping Times / rank @@
+Normal rank
@@ Property / cites work @@
+Q4039749
@@ Property / cites work: Q4039749 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3976408
@@ Property / cites work: Q3976408 / rank @@
+Normal rank
@@ Property / cites work @@
+A random polynomial time algorithm for well-routing convex bodies
+Normal rank
@@ Property / cites work @@
+Random walks on graphs
@@ Property / cites work: Random walks on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q3745276
@@ Property / cites work: Q3745276 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate counting, uniform generation and rapidly mixing Markov chains
+Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1805452