Revisiting the complexity of and/or graph solution (Q394337): Difference between revisions

@@ Property / arXiv ID @@
+.3249
@@ Property / arXiv ID: 1203.3249 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4453144
@@ Property / cites work: Q4453144 / rank @@
+Normal rank
@@ Property / cites work @@
+Models for parallel and distributed computation. Theory, algorithmic techniques and application
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+A randomized competitive algorithm for evaluating priced AND/OR trees
+Normal rank
@@ Property / cites work @@
+A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Computationally Related Problems
@@ Property / cites work: Computationally Related Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the Optimal Solutions to AND/OR Series-Parallel Graphs
+Normal rank