The following pages link to (Q5368738):
Displaying 10 items.
- Optimal separation in exact query complexities for Simon's problem (Q1672002) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- Deterministic Communication vs. Partition Number (Q4562279) (← links)
- (Q4577913) (← links)
- Low-Sensitivity Functions from Unambiguous Certificates. (Q4638078) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- (Q5088887) (← links)
- (Q5091781) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← links)
- Quadratically tight relations for randomized query complexity (Q5915578) (← links)