Pages that link to "Item:Q5470719"
From MaRDI portal
The following pages link to Using Nondeterminism to Amplify Hardness (Q5470719):
Displayed 13 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)
- Query complexity in errorless hardness amplification (Q901934) (← links)
- The value of help bits in randomized and average-case complexity (Q2012180) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q2695266) (← links)
- A PCP Characterization of AM (Q3012834) (← 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)
- Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
- (Q5092470) (← links)
- Direct Sum Testing (Q5348457) (← links)
- Paradigms for Unconditional Pseudorandom Generators (Q6149335) (← links)