![](/sites/default/files/styles/workshop_banner_sm_1x/public/pseudo_placeholder_final.png.jpg?itok=VPX2R-in)
Abstract
We give a deterministic poly(n)/epsilon^2 time algorithm for approximately counting (to within epsilon) the fraction of solutions to a system of quadratic n-variate equations over F2. Note that random sampling would yield a similar running time in terms of n and epsilon.