Pages that link to "Item:Q3541812"
From MaRDI portal
The following pages link to The Complexity of Local List Decoding (Q3541812):
Displayed 9 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
- Advice Lower Bounds for the Dense Model Theorem (Q2828224) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- (Q5090443) (← links)
- Erasures versus errors in local decoding and property testing (Q6074671) (← links)
- (Q6084353) (← links)
- Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? (Q6113106) (← links)