Pages that link to "Item:Q835643"
From MaRDI portal
The following pages link to A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643):
Displaying 4 items.
- A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
- Optimal direct sum results for deterministic and randomized decision tree complexity (Q407594) (← links)
- Improved direct product theorems for randomized query complexity (Q693002) (← links)
- Evaluation of exact quantum query complexities by semidefinite programming (Q2100824) (← links)