The following pages link to Approximate inclusion-exclusion (Q1174115):
Displaying 41 items.
- 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)
- Two approximate algorithms for model counting (Q507433) (← links)
- Small-bias is not enough to hit read-once CNF (Q519906) (← links)
- A note on approximate inclusion--exclusion (Q674916) (← links)
- Approximation algorithm for DNF under distributions with limited independence (Q675867) (← links)
- An efficient and flexible algorithm for online mining of large itemsets (Q834974) (← links)
- Inclusion-exclusion for \(k\)-CNF formulas (Q1014406) (← links)
- Exploiting case-based independence for approximating marginal probabilities (Q1125781) (← links)
- Counting propositional models (Q1197995) (← links)
- Resolving contradictions: A plausible semantics for inconsistent systems (Q1332637) (← links)
- Inclusion-exclusion: exact and approximate (Q1375692) (← links)
- A \(q\)-analog of approximation inclusion-exclusion (Q1383437) (← links)
- Contrast-optimal k out of n secret sharing schemes in visual cryptography (Q1575451) (← links)
- \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product (Q1671999) (← links)
- On measuring similarity for sequences of itemsets (Q1715867) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- Evaluating spectral norms for constant depth circuits with symmetric gates (Q1904669) (← links)
- Pseudorandom generators and learning algorithms for \(\mathrm{AC}^ 0\) (Q1918950) (← links)
- On deterministic approximation of DNF (Q1923857) (← links)
- The hardest halfspace (Q1983325) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Using binary patterns for counting falsifying assignments of conjunctive forms (Q2520658) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas (Q3007625) (← links)
- New Results on Visual Cryptography (Q3452369) (← links)
- Approximate Model Counting via Extension Rule (Q3452569) (← links)
- Information and evidence in logic systems (Q4297221) (← links)
- An Almost <i>m</i>-wise Independent Random Permutation of the Cube (Q4715261) (← links)
- Explaining by evidence (Q4779486) (← links)
- Is there an alternative to parsimonious semantics? (Q4864836) (← links)
- On the Probabilistic Degrees of Symmetric Boolean Functions (Q4959660) (← links)
- (Q5077146) (← links)
- Near-optimal pseudorandom generators for constant-depth read-once formulas (Q5091767) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- The maximal probability that <i>k</i>‐wise independent bits are all 1 (Q5198667) (← links)
- Approximating real-rooted and stable polynomials, with combinatorial applications (Q5216314) (← links)
- Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
- Simplifying Inclusion–Exclusion Formulas (Q5364235) (← links)
- (Q5875501) (← links)
- The work of Mark Braverman (Q6200321) (← links)
