Equivalence Problems for Circuits over Sets of Natural Numbers

@article{Glaer2008EquivalencePF,
  title={Equivalence Problems for Circuits over Sets of Natural Numbers},
  author={Christian Gla\sser and Katrin Herr and Christian Reitwie\ssner and Stephen D. Travers and Matthias Waldherr},
  journal={Theory of Computing Systems},
  year={2008},
  volume={46},
  pages={80-103}
}
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,Π 2 P , PSPACE, NEXP, and beyond. McKenzie and Wagner (2003) studied… CONTINUE READING