Random walks for selected Boolean implication and equivalence problems (Q1014275): Difference between revisions

@@ Property / author @@
-Q261361
@@ Property / author: Q261361 / rank @@
-Normal rank
@@ Property / author @@
+K. Subramani and Vahan Mkrtchyan
@@ Property / author: K. Subramani and Vahan Mkrtchyan / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00236-009-0089-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2059356058
@@ Property / OpenAlex ID: W2059356058 / rank @@
+Normal rank
@@ Property / cites work @@
+A randomized linear-time algorithm to find minimum spanning trees
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4507776
@@ Property / cites work: Q4507776 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4779137
@@ Property / cites work: Q4779137 / rank @@
+Normal rank
@@ Property / cites work @@
+Absorbing Random Walks and the NAE2SAT Problem
@@ Property / cites work: Absorbing Random Walks and the NAE2SAT Problem / rank @@
+Normal rank
@@ Property / cites work @@
+CASCADING RANDOM WALKS
@@ Property / cites work: CASCADING RANDOM WALKS / rank @@
+Normal rank
@@ Property / cites work @@
+A theory of the learnable
@@ Property / cites work: A theory of the learnable / rank @@
+Normal rank