The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers

@article{McKenzie2007TheCO,
  title={The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers},
  author={Pierre McKenzie and Klaus W. Wagner},
  journal={computational complexity},
  year={2007},
  volume={16},
  pages={211-244}
}
  • Pierre McKenzie, Klaus W. Wagner
  • Published 2007
  • Computer Science, Mathematics
  • computational complexity
  • Abstract.The problem of testing membership in the subset of the natural numbers produced at the output gate of a {$$\bigcup, \bigcap, ^-, +, \times$$} combinational circuit is shown to capture a wide range of complexity classes. Although the general problem remains open, the case {$$\bigcup, \bigcap, +, \times$$} is shown NEXPTIME-complete, the cases {$$\bigcup, \bigcap, ^-, \times$$ }, {$$\bigcup, \bigcap, \times$$}, {$$\bigcup, \bigcap, +$$} are shown PSPACE-complete, the case {$$\bigcup… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 46 CITATIONS, ESTIMATED 68% COVERAGE

    Equations over Sets of Natural Numbers with Addition Only

    VIEW 1 EXCERPT
    CITES BACKGROUND

    The complexity of membership problems for circuits over sets of integers

    VIEW 31 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    On equations over sets of integers

    Emptiness Problems for Integer Circuits

    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS

    Emptiness problems for integer circuits

    Satisfiability of Algebraic Circuits over Sets of Natural Numbers

    VIEW 6 EXCERPTS
    CITES RESULTS & BACKGROUND
    HIGHLY INFLUENCED

    Unambiguous Conjunctive Grammars over a One-Letter Alphabet

    Equivalence Problems for Circuits over Sets of Natural Numbers

    VIEW 10 EXCERPTS
    CITES BACKGROUND, RESULTS & METHODS
    HIGHLY INFLUENCED

    FILTER CITATIONS BY YEAR

    2005
    2020

    CITATION STATISTICS

    • 10 Highly Influenced Citations

    References

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

    Parallel Algorithms for Algebraic Problems

    Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds

    VIEW 2 EXCERPTS

    Integer circuit evaluation is PSPACE-complete

    • Ke Yang
    • Computer Science, Mathematics
    • Proceedings 15th Annual IEEE Conference on Computational Complexity
    • 2000
    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Computing Algebraic Formulas Using a Constant Number of Registers

    VIEW 1 EXCERPT

    Separation of the Monotone NC Hierarchy

    VIEW 1 EXCERPT

    Constant Depth Reducibility