The following pages link to Hardness amplification within NP (Q5917544):
Displaying 17 items.
- On derandomization and average-case complexity of monotone functions (Q428873) (← links)
- A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
- Complexity of hard-core set proofs (Q451110) (← links)
- Hardness amplification within NP against deterministic algorithms (Q619904) (← links)
- The Gaussian surface area and noise sensitivity of degree-\(d\) polynomial threshold functions (Q645127) (← 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)
- On the (im)possibility of non-interactive correlation distillation (Q2381528) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- Query Complexity in Errorless Hardness Amplification (Q3088136) (← links)
- On uniform amplification of hardness in NP (Q3581414) (← links)
- Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits (Q4568115) (← links)
- UG-hardness to NP-hardness by losing half (Q5091753) (← links)
- Hardness Amplification Proofs Require Majority (Q5390590) (← links)
- Using Nondeterminism to Amplify Hardness (Q5470719) (← links)
- (Q5743502) (← links)