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

References

Publications referenced by this paper.
Showing 1-10 of 28 references

The complexity of problems concerning graphs with regularities

  • K. Wagner
  • Proceedings Mathematical Foundations of Computer…
  • 1984
Highly Influential
14 Excerpts

Approximate formulas for some functions of prime numbers

  • J. B. Rosser, L. Schoenfeld
  • Illinois Journal of Mathematics, 6:64–97
  • 1962
Highly Influential
2 Excerpts

Die Komplexität von Auswertungsproblemen für Schaltkreise über Mengen positiver natürlicher Zahlen

  • H. Breunig
  • Diploma Thesis, University of Würzburg
  • 2003
2 Excerpts

Similar Papers

Loading similar papers…