Pages that link to "Item:Q1275008"
From MaRDI portal
The following pages link to Randomized Boolean decision trees: Several remarks (Q1275008):
Displaying 8 items.
- Randomized vs. deterministic decision tree complexity for read-once Boolean functions (Q685705) (← links)
- Improved bounds for the randomized decision tree complexity of recursive majority (Q2811168) (← links)
- Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (Q3012816) (← links)
- A sprouting tree model for random boolean functions (Q3460511) (← links)
- On boolean decision trees with faulty nodes (Q4306374) (← links)
- (Q4577913) (← links)
- (Q4721494) (← links)
- Symmetries, graph properties, and quantum speedups (Q6654557) (← links)