The following pages link to (Q3187177):
Displaying 10 items.
- On block sensitivity and fractional block sensitivity (Q1992105) (← links)
- Conflict complexity is lower bounded by block sensitivity (Q2219069) (← links)
- On derandomized composition of Boolean functions (Q2281253) (← links)
- All Classical Adversary Methods are Equivalent for Total Functions (Q3304102) (← links)
- (Q4577913) (← links)
- Low-Sensitivity Functions from Unambiguous Certificates. (Q4638078) (← links)
- (Q5089146) (← links)
- A Composition Theorem for Randomized Query Complexity (Q5136299) (← links)
- Quadratically tight relations for randomized query complexity (Q5915578) (← links)
- On query complexity measures and their relations for symmetric functions (Q6547823) (← links)
