Emptiness problems for integer circuits

@article{Barth2020EmptinessPF,
  title={Emptiness problems for integer circuits},
  author={D. Barth and Moritz Beck and Titus Dose and Christian Gla{\ss}er and Larissa Michler and Marc Technau},
  journal={Theor. Comput. Sci.},
  year={2020},
  volume={824-825},
  pages={11-35}
}
Abstract 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… Expand

Topics from this paper

References

SHOWING 1-10 OF 32 REFERENCES
The complexity of membership problems for circuits over sets of integers
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic
Arithmetic Circuits: A survey of recent results and open questions
Integer Circuit Evaluation Is PSPACE-Complete
  • Ke Yang
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 2001
Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers
  • Titus Dose
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 2016
...
1
2
3
4
...