Pages that link to "Item:Q693002"
From MaRDI portal
The following pages link to Improved direct product theorems for randomized query complexity (Q693002):
Displayed 7 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)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- Forrelation: A Problem That Optimally Separates Quantum from Classical Computing (Q4571925) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- (Q5091781) (← links)
- Query-to-Communication Lifting Using Low-Discrepancy Gadgets (Q5856149) (← links)