Pages that link to "Item:Q1067786"
From MaRDI portal
The following pages link to Lower bounds on probabilistic linear decision trees (Q1067786):
Displaying 17 items.
- Randomized vs. deterministic decision tree complexity for read-once Boolean functions (Q685705) (← links)
- Query strategies for priced information (Q696973) (← links)
- Lower bounds to randomized algorithms for graph properties (Q808708) (← links)
- A randomized competitive algorithm for evaluating priced AND/OR trees (Q935154) (← links)
- Lower bounds on the length of universal traversal sequences (Q1201151) (← links)
- On read-once threshold formulae and their randomized decision tree complexity (Q1208407) (← links)
- Randomized Boolean decision trees: Several remarks (Q1275008) (← links)
- A lower bound for randomized algebraic decision trees (Q1386178) (← links)
- Simulating probabilistic by deterministic algebraic computation trees (Q1821560) (← links)
- Complexity measures and decision tree complexity: a survey. (Q1853508) (← links)
- Decision trees: Old and new results. (Q1854291) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case (Q2275907) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- Improved bounds for the randomized decision tree Complexity of recursive majority (Q2811168) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
- Separation Between Deterministic and Randomized Query Complexity (Q5376437) (← links)
