Pages that link to "Item:Q354649"
From MaRDI portal
The following pages link to DNF sparsification and a faster deterministic counting algorithm (Q354649):
Displaying 16 items.
- Complexity theory. Abstracts from the workshop held November 11--17, 2012. (Q343366) (← links)
- A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting (Q1656545) (← links)
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting (Q2009190) (← links)
- Improved bounds for quantified derandomization of constant-depth circuits and polynomials (Q2311548) (← links)
- Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas (Q2816303) (← links)
- (Q5009548) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- Fooling Polytopes (Q5066946) (← links)
- (Q5077146) (← links)
- (Q5091755) (← links)
- Near-optimal pseudorandom generators for constant-depth read-once formulas (Q5091767) (← links)
- Coding for Sunflowers (Q5126764) (← links)
- Amplification and Derandomization without Slowdown (Q5129234) (← links)
- Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
- (Q5875501) (← links)
- Monotone circuit lower bounds from robust sunflowers (Q5970784) (← links)
