72 citations · 399 across the 60 of their papers we have counts for
Showing 2013 · cs.CCShow all
2 papers · 2 filters
cs.CC2013
Deterministic Approximate Counting for Juntas of Degree- Polynomial Threshold Functions
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
Let be any Boolean function and be any degree-2 polynomials over We give a \emph{deterministic} algorithm which, given as…
cs.CC2013
Deterministic Approximate Counting for Degree- Polynomial Threshold Functions
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
We give a {\em deterministic} algorithm for approximately computing the fraction of Boolean assignments that satisfy a degree- polynomial threshold function. Given a degree-2 in…