Pages that link to "Item:Q685705"
From MaRDI portal
The following pages link to Randomized vs. deterministic decision tree complexity for read-once Boolean functions (Q685705):
Displaying 7 items.
- Query strategies for priced information (Q696973) (← links)
- Complexity measures and decision tree complexity: a survey. (Q1853508) (← links)
- Identification of partial disjunction, parity, and threshold functions (Q1978506) (← links)
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case (Q2275907) (← links)
- Finding optimal satisficing strategies for and-or trees (Q2457646) (← links)
- Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (Q3012816) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
