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 42 items.
- 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)
- Robust characterizations of <i>k</i> -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)
- (Q4612482) (← links)
- Improved boolean formulas for the Ramsey graphs (Q4845078) (← links)
- (Q4993281) (← links)
- (Q4993293) (← links)
- (Q5002692) (← links)
- A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas (Q5002707) (← links)
- (Q5005182) (← links)
- MODp-tests, almost independence and small probability spaces (Q5047166) (← 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)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- (Q5121889) (← links)
- (Q5158498) (← links)
- Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
- (Q5875498) (← links)
- (Q5875501) (← 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)
- Rigid matrices from rectangular PCPs (Q6491304) (← links)
