Pages that link to "Item:Q5136299"
From MaRDI portal
The following pages link to A Composition Theorem for Randomized Query Complexity (Q5136299):
Displaying 6 items.
- Conflict complexity is lower bounded by block sensitivity (Q2219069) (← links)
- (Q4577913) (← links)
- The Zero-Error Randomized Query Complexity of the Pointer Function (Q4636563) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- REMARKS ON A QUERY-BASED VARIANT OF THE PARALLEL REPETITION THEOREM (Q5249275) (← links)
- (Q6062152) (← links)