The following pages link to (Q4418651):
Displaying 12 items.
- Average-case intractability vs. worst-case intractability (Q598182) (← links)
- Relations between average-case and worst-case complexity (Q927398) (← links)
- Randomization, derandomization and antirandomization: Three games (Q1331937) (← links)
- Randomness vs time: Derandomization under a uniform assumption (Q1604214) (← links)
- Some results on derandomization (Q1771319) (← links)
- In search of an easy witness: Exponential time vs. probabilistic polynomial time. (Q1872732) (← links)
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) (Q2120065) (← links)
- Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
- Uniform Derandomization from Pathetic Lower Bounds (Q3588422) (← links)
- (Q4472432) (← links)
- A Fast Derandomization Scheme and Its Applications (Q4875445) (← links)
- Derandomizing Knockoffs (Q6165283) (← links)