Pages that link to "Item:Q2475580"
From MaRDI portal
The following pages link to If NP languages are hard on the worst-case, then it is easy to find their hard instances (Q2475580):
Displaying 3 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)
- Capturing one-way functions via NP-hardness of meta-complexity (Q6499280) (← links)
