The following pages link to Sergei Artemenko (Q301521):
Displaying 7 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- (Q4601848) (← links)
- Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size Circuits (Q4973883) (← links)
- Pseudorandom generators with optimal seed length for non-boolean poly-size circuits (Q5259543) (← links)
- Pseudorandomness when the odds are against you (Q5368743) (← links)
