Randomized vs. deterministic decision tree complexity for read-once Boolean functions (Q685705): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Learning read-once formulas with queries
@@ Property / cites work: Learning read-once formulas with queries / rank @@
+Normal rank
@@ Property / cites work @@
+On read-once threshold formulae and their randomized decision tree complexity
+Normal rank
@@ Property / cites work @@
+The solution for the branching factor of the alpha-beta pruning algorithm and its optimality
+Normal rank
@@ Property / cites work @@
+Lower bounds on probabilistic linear decision trees
+Normal rank
@@ Property / cites work @@
+Optimal Search on Some Game Trees
@@ Property / cites work: Optimal Search on Some Game Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Short monotone formulae for the majority function
@@ Property / cites work: Short monotone formulae for the majority function / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01212962
+Normal rank
@@ Property / OpenAlex ID @@
+W2134298805
@@ Property / OpenAlex ID: W2134298805 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:685705