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.
- 3SUM, 3XOR, triangles (Q261365) (← links)
- Finding a minimal 1-DNF consistent with a positive sample is LOGSNP-complete (Q294591) (← links)
- Derandomizing restricted isometries via the Legendre symbol (Q295815) (← links)
- Binary quantum hashing (Q327965) (← links)
- Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields (Q395606) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- On the minimal Fourier degree of symmetric Boolean functions (Q397079) (← links)
- On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries (Q420768) (← links)
- Hierarchy theorems for property testing (Q430844) (← links)
- On possible dependence structures of a set of random variables (Q452848) (← links)
- Small-bias is not enough to hit read-once CNF (Q519906) (← links)
- The communication complexity of addition (Q519955) (← links)
- Testing periodicity (Q534782) (← links)
- The isomorphism conjecture for constant depth reductions (Q619896) (← links)
- Explicit constructions of RIP matrices and related problems (Q635478) (← links)
- \(\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)
- On rigid matrices and \(U\)-polynomials (Q901935) (← links)
- Four decades of research on bent functions (Q908040) (← 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)
- Randomized OBDD-based graph algorithms (Q1625606) (← links)
- Secure computation using leaky correlations (asymptotically optimal constructions) (Q1631316) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- Matrix rigidity of random Toeplitz matrices (Q1653338) (← links)
- Constructions of almost secure frameproof codes with applications to fingerprinting schemes (Q1741920) (← 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)
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
- Explicit small sets with \(\varepsilon\)-discrepancy on Bohr sets (Q2015154) (← links)
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- Essential components in vector spaces over finite fields (Q2043673) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- 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)
