Pages that link to "Item:Q1201152"
From MaRDI portal
The following pages link to Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs (Q1201152):
Displaying 15 items.
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- (Q5077146) (← links)
- (Q5090432) (← links)
- Typically-correct derandomization for small time and space (Q5091759) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- Simple Optimal Hitting Sets for Small-Success RL (Q5115702) (← links)
- Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
- (Q5875501) (← links)
- Improved Extractors for Recognizable and Algebraic Sources (Q5875532) (← links)
- (Q6062142) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
- Monomial Boolean functions with large high-order nonlinearities (Q6204170) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q6623584) (← links)
- The splitting power of branching programs of bounded repetition and CNFs of bounded width (Q6648277) (← links)