Pages that link to "Item:Q3137711"
From MaRDI portal
The following pages link to Small-Bias Probability Spaces: Efficient Constructions and Applications (Q3137711):
Displaying 50 items.
- 3SUM, 3XOR, triangles (Q261365) (← links)
- Derandomizing restricted isometries via the Legendre symbol (Q295815) (← links)
- A dichotomy for local small-bias generators (Q315550) (← links)
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- DNF sparsification and a faster deterministic counting algorithm (Q354649) (← 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)
- More on average case vs approximation complexity (Q430823) (← links)
- Hierarchy theorems for property testing (Q430844) (← links)
- Revisiting iterated attacks in the context of decorrelation theory (Q458736) (← links)
- Small-bias is not enough to hit read-once CNF (Q519906) (← links)
- The communication complexity of addition (Q519955) (← links)
- Symmetric LDPC codes and local testing (Q519972) (← links)
- Testing periodicity (Q534782) (← links)
- The isomorphism conjecture for constant depth reductions (Q619896) (← links)
- Deterministic parallel algorithms for bilinear objective functions (Q666681) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- Approximation algorithm for DNF under distributions with limited independence (Q675867) (← links)
- Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
- Secure sequential transmission of quantum information (Q747822) (← links)
- Checking the correctness of memories (Q890427) (← links)
- On rigid matrices and \(U\)-polynomials (Q901935) (← links)
- Almost \(k\)-wise independence versus \(k\)-wise independence (Q1028993) (← links)
- Defaults and relevance in model-based reasoning (Q1127354) (← links)
- Approximating hyper-rectangles: Learning and pseudorandom sets (Q1278043) (← links)
- Sparse hard sets for P: Resolution of a conjecture of Hartmanis (Q1288202) (← links)
- Extracting randomness: A survey and new constructions (Q1305929) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- (De)randomized construction of small sample spaces in \(\mathcal{NC}\) (Q1384529) (← links)
- Almost \(k\)-wise independence and hard Boolean functions. (Q1401305) (← links)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- Randomized OBDD-based graph algorithms (Q1625606) (← links)
- Secure computation using leaky correlations (asymptotically optimal constructions) (Q1631316) (← links)
- Interactive communication with unknown noise rate (Q1641020) (← links)
- On the ring-LWE and polynomial-LWE problems (Q1648786) (← links)
- Matrix rigidity of random Toeplitz matrices (Q1653338) (← links)
- A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting (Q1656545) (← links)
- Constructions of almost secure frameproof codes with applications to fingerprinting schemes (Q1741920) (← links)
- On the capacity of Boolean graph formulæ (Q1805371) (← links)
- Approximate swapped matching. (Q1853034) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- More efficient PAC-learning of DNF with membership queries under the uniform distribution (Q1878685) (← links)
- On the extremal combinatorics of the Hamming space (Q1894014) (← links)
- On deterministic approximation of DNF (Q1923857) (← links)
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (Q1923858) (← links)
- Randomized geometric algorithms and pseudorandom generators (Q1923860) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Efficient branching programs for quantum hash functions generated by small-biased sets (Q1992102) (← 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)
