Chapter

Computer Science – Theory and Applications

Volume 4649 of the series Lecture Notes in Computer Science pp 127-138

Equivalence Problems for Circuits over Sets of Natural Numbers

  • Christian GlaßerAffiliated withJulius-Maximilians-Universität Würzburg, Theoretische Informatik
  • , Katrin HerrAffiliated withJulius-Maximilians-Universität Würzburg, Theoretische Informatik
  • , Christian ReitwießnerAffiliated withJulius-Maximilians-Universität Würzburg, Theoretische Informatik
  • , Stephen TraversAffiliated withJulius-Maximilians-Universität Würzburg, Theoretische Informatik
  • , Matthias WaldherrAffiliated withJulius-Maximilians-Universität Würzburg, Theoretische Informatik

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We investigate the complexity of equivalence problems for { ∪ , ∩ , , + ,×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer and Meyer (1973). We continue this line of research and give a systematic characterization of the complexity of equivalence problems over sets of natural numbers. Our work shows that equivalence problems capture a wide range of complexity classes like NL, C=L, P,\({\rm \Pi^P_{2}}\), PSPACE, NEXP, and beyond. McKenzie and Wagner (2003) studied related membership problems for circuits over sets of natural numbers. Our results also have consequences for these membership problems: We provide an improved upper bound for the case of { ∪ , ∩ , , + ,×}-circuits.