Pages that link to "Item:Q4014640"

The following pages link to Simple Constructions of Almost k-wise Independent Random Variables (Q4014640):

Displaying 33 items.

• Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
• Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space (Q5096446) (← links)
• Worst-Case to Average-Case Reductions for Subclasses of P (Q5098780) (← links)
• On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions (Q5098782) (← links)
• Constant-Round Interactive Proof Systems for AC0[2] and NC1 (Q5098783) (← links)
• (Q5121889) (← links)
• Amplification and Derandomization without Slowdown (Q5129234) (← links)
• (Q5158498) (← links)
• The maximal probability that <i>k</i>‐wise independent bits are all 1 (Q5198667) (← links)
• Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
• Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited (Q5267415) (← links)
• Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)
• Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker (Q5445521) (← links)
• Optimal $\varepsilon$-Biased Sets with Just a Little Randomness (Q5499738) (← links)
• Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification (Q5502802) (← links)
• Explicit Near-Ramanujan Graphs of Every Degree (Q5856148) (← links)
• A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3 (Q5862347) (← links)
• (Q5875498) (← links)
• (Q5875501) (← links)
• The size-Ramsey number of trees (Q5916315) (← links)
• Sample spaces with small bias on neighborhoods and error-correcting communication protocols (Q5945921) (← links)
• Almost \(k\)-wise independent sample spaces and their cryptologic applications (Q5950639) (← links)
• Deterministic Massively Parallel Connectivity (Q6069413) (← links)
• Component stability in low-space massively parallel computation (Q6126138) (← links)
• Efficient Linear and Affine Codes for Correcting Insertions/Deletions (Q6156613) (← links)
• Bit security as computational cost for winning games with high probability (Q6157548) (← links)
• Universal Hashing via Integer Arithmetic Without Primes, Revisited (Q6163629) (← links)
• Rigid matrices from rectangular PCPs (Q6491304) (← links)
• Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
• Deterministic document exchange protocols and almost optimal binary codes for edit errors (Q6551260) (← links)
• Unified view for notions of bit security (Q6605331) (← links)
• One-tape Turing machine and branching program lower bounds for MCSP (Q6614616) (← links)
• Finding and counting small tournaments in large tournaments (Q6652454) (← links)