# Emptiness Problems for Integer Circuits

@article{Barth2017EmptinessPF, title={Emptiness Problems for Integer Circuits}, author={Dominik Barth and Moritz Beck and Titus Dose and Christian Gla\sser and Larissa Michler and Marc Technau}, journal={Electronic Colloquium on Computational Complexity (ECCC)}, year={2017}, volume={24}, pages={12} }

- Published 2017 in MFCS
DOI:10.4230/LIPIcs.MFCS.2017.33

We study the computational complexity of emptiness problems for circuits over sets of natural numbers with the operations union, intersection, complement, addition, and multiplication. For most settings of allowed operations we precisely characterize the complexity in terms of completeness for classes like NL, NP, and PSPACE. The case where intersection, addition, and multiplication is allowed turns out to be equivalent to the complement of polynomial identity testing (PIT). Our results imply… CONTINUE READING