Pages that link to "Item:Q744610"
From MaRDI portal
The following pages link to Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610):
Displaying 9 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Query complexity in errorless hardness amplification (Q901934) (← links)
- The power of adaptiveness and additional queries in random-self- reductions (Q1332664) (← links)
- Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information (Q1635841) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- (Q5414625) (← 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)