Pages that link to "Item:Q5313044"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313044):
Displaying 15 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)
- A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting (Q1656545) (← links)
- On deterministic approximation of DNF (Q1923857) (← links)
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting (Q2009190) (← links)
- Solving and sampling with many solutions (Q2309479) (← links)
- Exploiting independent subformulas: a faster approximation scheme for \(\# k\)-SAT (Q2450932) (← links)
- An approximation algorithm for \(\#k\)-SAT (Q2904751) (← links)
- Pseudorandomness for width-2 branching programs (Q3191575) (← links)
- Variable Influences in Conjunctive Normal Forms (Q3637162) (← links)
- (Q5077146) (← links)
- Solving and sampling with many solutions: Satisfiability and other hard problems (Q5111870) (← links)
- Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
- (Q5875501) (← links)