Pages that link to "Item:Q619904"
From MaRDI portal
The following pages link to Hardness amplification within NP against deterministic algorithms (Q619904):
Displaying 10 items.
- 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)
- Hardness amplification via space-efficient direct products (Q2269003) (← links)
- A zero-one law for RP and derandomization of AM if NP is not small (Q2389331) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- On uniform amplification of hardness in NP (Q3581414) (← links)
- UG-hardness to NP-hardness by losing half (Q5091753) (← links)
- Using Nondeterminism to Amplify Hardness (Q5470719) (← links)
- (Nondeterministic) hardness vs. non-malleability (Q6097260) (← links)