Pages that link to "Item:Q301524"
From MaRDI portal
The following pages link to Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524):
Displaying 6 items.
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- The Journey from NP to TFNP Hardness (Q4638115) (← links)
- Improved Extractors for Recognizable and Algebraic Sources (Q5875532) (← links)
- (Q6084353) (← links)
- Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? (Q6113106) (← links)
- Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
