The following pages link to Approximate inclusion-exclusion (Q1174115):
Displayed 19 items.
- 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)
- 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)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← 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)