The following pages link to Complexity of hard-core set proofs (Q451110):
Displaying 6 items.
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
- Advice lower bounds for the dense model theorem (Q2828224) (← links)
- Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator (Q2904626) (← links)
- Hard-core theorems for complexity classes (Q3769964) (← links)
- (Q3822152) (← links)
- (Q5005177) (← links)