Query strategies for priced information (Q696973): Difference between revisions

@@ Property / OpenAlex ID @@
+W2130519052
@@ Property / OpenAlex ID: W2130519052 / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum latency problem
@@ Property / cites work: The minimum latency problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized vs. deterministic decision tree complexity for read-once Boolean functions
+Normal rank
@@ Property / cites work @@
+Q4875190
@@ Property / cites work: Q4875190 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4818841
@@ Property / cites work: Q4818841 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on probabilistic linear decision trees
+Normal rank
@@ Property / cites work @@
+On the Optimality of Randomized $\alpha$-$\beta$ Search
+Normal rank