Equivalence Problems for Circuits over Sets of Natural Numbers

@article{Glaer2008EquivalencePF,
  title={Equivalence Problems for Circuits over Sets of Natural Numbers},
  author={Christian Gla{\ss}er and Katrin Herr and Christian Reitwie{\ss}ner 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
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 11 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 23 REFERENCES

Adaptive logspace reducibility and parallel time

  • Mathematical systems theory
  • 1995
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

The complexity of problems concerning graphs with regularities

K. Wagner
  • Proceedings Mathematical Foundations of Computer Science, volume 176 of Lecture Notes in Computer Science, pages 544–552. Springer-Verlag
  • 1984
VIEW 14 EXCERPTS
HIGHLY INFLUENTIAL

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

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

In IEEE Conference on Computational Complexity

K. Yang. Integer circuit evaluation is PSPACE-complete
  • pages 204–213,
  • 2000
VIEW 2 EXCERPTS

Similar Papers

Loading similar papers…