Pages that link to "Item:Q3586194"
From MaRDI portal
The following pages link to Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized (Q3586194):
Displaying 19 items.
- Improved direct product theorems for randomized query complexity (Q693002) (← links)
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
- Query complexity in errorless hardness amplification (Q901934) (← links)
- A note on the relation between XOR and selective XOR lemmas (Q2203599) (← links)
- Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
- Advice lower bounds for the dense model theorem (Q2828224) (← links)
- A PCP Characterization of AM (Q3012834) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- On Yao’s XOR-Lemma (Q3088189) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- (Q5090443) (← links)
- Relations and equivalences between circuit lower bounds and karp-lipton theorems (Q5091782) (← links)
- (Q5093398) (← links)
- Worst-Case to Average-Case Reductions for Subclasses of P (Q5098780) (← links)
- Direct Sum Testing (Q5348457) (← links)
- List-Decoding with Double Samplers (Q5856152) (← links)
- (Q5875496) (← links)
- Erasures versus errors in local decoding and property testing (Q6074671) (← links)
- \(k\)-SUM in the sparse regime: complexity and applications (Q6648210) (← links)
