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 K. 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,Π2P, PSPACE, NEXP, and beyond. McKenzie and Wagner (2003) studied… Expand
Emptiness problems for integer circuits
Balance problems for integer circuits
  • Titus Dose
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 2019
Balance Problems for Integer Circuits
  • Titus Dose
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 2018
Emptiness Problems for Integer Circuits
Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers
  • Titus Dose
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 2016
Complexity of Equations over Sets of Natural Numbers
Functions Definable by Arithmetic Circuits
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic
...
1
2
...

References

SHOWING 1-10 OF 28 REFERENCES
The Complexity of Membership Problems for Circuits over Sets of Positive Numbers
The Complexity of Membership Problems for Circuits over Sets of Integers
Integer circuit evaluation is PSPACE-complete
  • Ke Yang
  • Mathematics, Computer Science
  • Proceedings 15th Annual IEEE Conference on Computational Complexity
  • 2000
Relationships Among PL, #L, and the Determinant
On the Boolean closure of NP
Adaptive logspace reducibility and parallel time
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
On the Power of Random Access Machines
Computational Complexity of Probabilistic Turing Machines
  • John Gill
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1977
On the Tape Complexity of Deterministic Context-Free Languages
...
1
2
3
...