works on
circuit complexity 2ACC^0 1AND function 1approximation theory 1CC^0 circuits 1linear programming 1lower bounds 1majority function 1symmetry 1torus polynomial approximation 1torus polynomials 1

From the 2 of 3 linked papers with an AI index.

collaborators
Showing cs.LOShow all

1 paper · 1 filter

cs.LO2026

On Proof Systems for #QBF

Sravanthi Chede, Leroy Chew, Vaibhav Krishan +1

For a quantified Boolean formula (QBF), the problem of computing the number of winning strategies is known as the #QBF problem. This problem is considered harder than the analogous…