Pages that link to "Item:Q354645"
From MaRDI portal
The following pages link to A strong direct product theorem for quantum query complexity (Q354645):
Displaying 5 items.
- A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
- A strong direct product theorem for quantum query complexity (Q354645) (← links)
- Improved direct product theorems for randomized query complexity (Q693002) (← links)
- (Q5089146) (← links)
- Tight characterizations for preprocessing against cryptographic salting (Q6652927) (← links)
