Pages that link to "Item:Q1604214"

The following pages link to Randomness vs time: Derandomization under a uniform assumption (Q1604214):

Displaying 18 items.

• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
• Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
• Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
• On uniformity and circuit lower bounds (Q488049) (← links)
• The size of SPP (Q596117) (← links)
• The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
• Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
• A zero-one SUBEXP-dimension law for BPP (Q1944915) (← links)
• Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
• Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
• Natural Proofs versus Derandomization (Q2805512) (← links)
• Limits on the Computational Power of Random Strings (Q3012814) (← links)
• Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
• In a World of P=BPP (Q3088186) (← links)
• (Q5002697) (← links)
• Randomness and Intractability in Kolmogorov Complexity (Q5091181) (← links)
• (Q6084358) (← links)
• Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)