Pages that link to "Item:Q3581414"
From MaRDI portal
The following pages link to On uniform amplification of hardness in NP (Q3581414):
Displaying 14 items.
- Complexity of hard-core set proofs (Q451110) (← links)
- Hardness amplification within NP against deterministic algorithms (Q619904) (← 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)
- Uniform generation of NP-witnesses using an NP-oracle (Q1854397) (← links)
- A zero-one law for RP and derandomization of AM if NP is not small (Q2389331) (← links)
- On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
- UG-hardness to NP-hardness by losing half (Q5091753) (← links)
- Using Nondeterminism to Amplify Hardness (Q5470719) (← links)
- List-Decoding with Double Samplers (Q5856152) (← links)
- Hardness amplification within NP (Q5917544) (← links)