Pages that link to "Item:Q3604852"

The following pages link to On the Complexity of Hardness Amplification (Q3604852):

Displaying 9 items.

• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
• Complexity of hard-core set proofs (Q451110) (← links)
• Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
• Improved hardness amplification in NP (Q868960) (← links)
• Query complexity in errorless hardness amplification (Q901934) (← 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)
• (Q6084353) (← links)
• Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? (Q6113106) (← links)