Pages that link to "Item:Q4014640"
From MaRDI portal
The following pages link to Simple Constructions of Almost k-wise Independent Random Variables (Q4014640):
Displayed 34 items.
- \(\varepsilon\)-discrepancy sets and their application for interpolation of sparse polynomials (Q672974) (← links)
- Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
- A well-characterized approximation problem (Q688442) (← links)
- A derandomization using min-wise independent permutations (Q876688) (← links)
- Parity check matrices and product representations of squares (Q949791) (← links)
- The complexity of the matroid-greedoid partition problem (Q1006060) (← links)
- A note on monotone complexity and the rank of matrices (Q1014450) (← links)
- Almost \(k\)-wise independence versus \(k\)-wise independence (Q1028993) (← links)
- On the computational power of depth-2 circuits with threshold and modulo gates (Q1269909) (← links)
- Approximating hyper-rectangles: Learning and pseudorandom sets (Q1278043) (← links)
- Extracting randomness: A survey and new constructions (Q1305929) (← links)
- Fast algorithms for approximately counting mismatches (Q1313761) (← links)
- Packings with large minimum kissing numbers (Q1377762) (← links)
- Almost \(k\)-wise independence and hard Boolean functions. (Q1401305) (← links)
- Min-wise independent permutations (Q1577016) (← links)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- On designs in compact metric spaces and a universal bound on their size (Q1584452) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- A connection between random variables and latin \(k\)-cubes (Q1903745) (← links)
- Pattern minimisation in cutting stock problems (Q1961237) (← links)
- The cell probe complexity of succinct data structures (Q2373728) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- On the optimality of quantum encryption schemes (Q3442020) (← links)
- Small Sample Spaces Cannot Fool Low Degree Polynomials (Q3541801) (← links)
- Balanced Hashing, Color Coding and Approximate Counting (Q3656847) (← links)
- (Q4521547) (← 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)
- Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)
- Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker (Q5445521) (← links)
- Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification (Q5502802) (← links)
- The size-Ramsey number of trees (Q5916315) (← links)