Pages that link to "Item:Q1923857"
From MaRDI portal
The following pages link to On deterministic approximation of DNF (Q1923857):
Displaying 19 items.
- DNF sparsification and a faster deterministic counting algorithm (Q354649) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Approximation algorithm for DNF under distributions with limited independence (Q675867) (← links)
- On limitations of structured (deterministic) DNNFs (Q778525) (← links)
- On sparse approximations to randomized strategies and convex combinations (Q1322876) (← links)
- On the relationship between \(\varepsilon\)-biased random variables and \(\varepsilon\)-dependent random variables (Q1328759) (← links)
- A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting (Q1656545) (← links)
- An approximately fast algorithm for deciding the validity of disjunctive normal forms (DNFs) (Q1801736) (← links)
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting (Q2009190) (← links)
- (Q3783561) (← links)
- On polynomial approximations to AC (Q4633319) (← links)
- A Switching Lemma for Small Restrictions and Lower Bounds for <i>k</i>-DNF Resolution (Q4651510) (← links)
- (Q5077146) (← links)
- (Q5090936) (← links)
- (Q5091755) (← links)
- Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313044) (← links)
- (Q5875501) (← links)
- On the probabilistic degree of OR over the reals (Q6074648) (← links)