Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds.

Ninad Rajgopal, Rahul Santhanam, Srikanth Srinivasan

Browse the full MFCS paper archive.