Pages that link to "Item:Q5390590"

The following pages link to Hardness Amplification Proofs Require Majority (Q5390590):

Displaying 20 items.

• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
• Randomness buys depth for approximate counting (Q483707) (← links)
• The communication complexity of addition (Q519955) (← links)
• Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
• Query complexity in errorless hardness amplification (Q901934) (← links)
• \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product (Q1671999) (← links)
• Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
• Natural Proofs versus Derandomization (Q2805512) (← links)
• Advice Lower Bounds for the Dense Model Theorem (Q2828224) (← links)
• Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
• Query Complexity in Errorless Hardness Amplification (Q3088136) (← links)
• A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (Q4957916) (← links)
• Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
• (Q5091223) (← links)
• Fourier bounds and pseudorandom generators for product tests (Q5091757) (← links)
• (Q5092470) (← links)
• On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions (Q5098770) (← links)
• (Q6084353) (← links)
• Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? (Q6113106) (← links)
• A robust version of Hegedűs's lemma, with applications (Q6566590) (← links)