Equivalence Problems for Circuits over Sets of Natural Numbers

@article{Glaer2008EquivalencePF,
  title={Equivalence Problems for Circuits over Sets of Natural Numbers},
  author={C. 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}
}
  • C. Glaßer, K. Herr, +2 authors Matthias Waldherr
  • Published 2008
  • Mathematics, Computer Science
  • Theory of Computing Systems
  • 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… CONTINUE READING
    16 Citations
    Emptiness problems for integer circuits
    Balance problems for integer circuits
    • T. Dose
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 2019
    • 1
    • PDF
    Balance Problems for Integer Circuits
    • T. Dose
    • Computer Science, Mathematics
    • Electron. Colloquium Comput. Complex.
    • 2018
    Emptiness Problems for Integer Circuits
    • 4
    • PDF
    Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers
    • T. Dose
    • Computer Science, Mathematics
    • Electron. Colloquium Comput. Complex.
    • 2016
    • 6
    • PDF
    Complexity of Equations over Sets of Natural Numbers
    • 30
    • Highly Influenced
    • PDF
    Functions Definable by Arithmetic Circuits
    • 11
    • PDF
    Circuit satisfiability and constraint satisfaction around Skolem Arithmetic
    • 7
    • PDF
    Constraint Satisfaction Problems around Skolem Arithmetic
    • 2
    • PDF

    References

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