Pages that link to "Item:Q5275368"
From MaRDI portal
The following pages link to Towards Better Separation between Deterministic and Randomized Query Complexity (Q5275368):
Displaying 10 items.
- Optimal separation in exact query complexities for Simon's problem (Q1672002) (← links)
- Efficient and optimal query answering on independent schemes (Q2639633) (← links)
- On the complexity of query result diversification (Q2790132) (← links)
- (Q3002819) (← links)
- Deterministic Communication vs. Partition Number (Q4562279) (← links)
- (Q4577913) (← links)
- Separations in Query Complexity Based on Pointer Functions (Q4640297) (← links)
- (Q5091781) (← links)
- Separation Between Deterministic and Randomized Query Complexity (Q5376437) (← links)
- The 1-Versus-2 Queries Problem Revisited (Q5387752) (← links)