Pages that link to "Item:Q4907578"
From MaRDI portal
The following pages link to Strong Direct Product Theorems for Quantum Communication and Query Complexity (Q4907578):
Displaying 25 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)
- Approximation of \(\operatorname{sgn} (x)\) on two symmetric intervals by rational functions with fixed poles (Q902187) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- Towards proving strong direct product theorems (Q1889851) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- New strong direct product results in communication complexity (Q2796407) (← links)
- The multiparty communication complexity of set disjointness (Q2817790) (← links)
- A strong direct product theorem for disjointness (Q2875134) (← links)
- Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (Q3448791) (← links)
- Interactive Information Complexity (Q3454520) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- Interactive Information Complexity (Q4592949) (← links)
- Strong Direct Product Theorems for Quantum Communication and Query Complexity (Q4907578) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- (Q5158501) (← links)
- (Q5419073) (redirect page) (← links)
- Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs (Q5422496) (← links)
- Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
- (Q5875509) (← links)
- (Q5875514) (← links)
- Tight characterizations for preprocessing against cryptographic salting (Q6652927) (← links)
