Pages that link to "Item:Q4014640"
From MaRDI portal
The following pages link to Simple Constructions of Almost k-wise Independent Random Variables (Q4014640):
Displaying 50 items.
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Quantum hashing for finite abelian groups (Q2361681) (← links)
- The cell probe complexity of succinct data structures (Q2373728) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)
- On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
- A one-time stegosystem and applications to efficient covert communication (Q2442646) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- Simple and efficient batch verification techniques for verifiable delay functions (Q2697899) (← links)
- Interactive Coding for Interactive Proofs (Q2799101) (← links)
- On construction of \(k\)-wise independent random variables (Q2817651) (← links)
- Robust characterizations of \(k\)-wise independence over product spaces and related testing results (Q2856576) (← links)
- A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 (Q2891385) (← links)
- Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions (Q2945374) (← links)
- Secret-Sharing Schemes: A Survey (Q3005578) (← links)
- Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs (Q3007622) (← links)
- Quantum Property Testing for Bounded-Degree Graphs (Q3088108) (← links)
- Three XOR-Lemmas — An Exposition (Q3088188) (← links)
- Expanding Generating Sets for Solvable Permutation Groups (Q3176493) (← links)
- Entropy of Weight Distributions of Small-Bias Spaces and Pseudobinomiality (Q3196409) (← links)
- On the optimality of quantum encryption schemes (Q3442020) (← links)
- New Results on Visual Cryptography (Q3452369) (← links)
- Consensus Patterns (Probably) Has no EPTAS (Q3452789) (← links)
- Randomized OBDD-Based Graph Algorithms (Q3460720) (← links)
- Small Sample Spaces Cannot Fool Low Degree Polynomials (Q3541801) (← links)
- Balanced Hashing, Color Coding and Approximate Counting (Q3656847) (← links)
- (Q4416890) (← links)
- \(\mathrm{MOD}_p\)-tests, almost independence and small probability spaces (Q4500687) (← links)
- Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547) (← links)
- Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8 (Q4562282) (← links)
- (Q4612482) (← links)
- The approximation of maximum subgraph problems (Q4630247) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- Efficient approximation of product distributions (Q4705321) (← links)
- An Almost <i>m</i>-wise Independent Random Permutation of the Cube (Q4715261) (← links)
- Improved boolean formulas for the Ramsey graphs (Q4845078) (← links)
- Hierarchy Theorems for Property Testing (Q4933380) (← links)
- Capacity of Interactive Communication over Erasure Channels and Channels with Feedback (Q4978197) (← links)
- Simple doubly-efficient interactive proof systems for locally-characterizable sets (Q4993281) (← links)
- Pseudorandom generators for low sensitivity functions (Q4993293) (← links)
- Small bias requires large formulas (Q5002692) (← links)
- A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas (Q5002707) (← links)
- (Q5005182) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- MODp-tests, almost independence and small probability spaces (Q5047166) (← links)
- Polynomial Data Structure Lower Bounds in the Group Model (Q5067444) (← links)
- (Q5077146) (← links)
- Short Proofs Are Hard to Find (Q5091243) (← links)
- Near-optimal pseudorandom generators for constant-depth read-once formulas (Q5091767) (← links)
- (Q5092453) (← links)
