Emptiness Problems for Integer Circuits

@inproceedings{Barth2017EmptinessPF,
  title={Emptiness Problems for Integer Circuits},
  author={Dominik Barth and Moritz Beck and Titus Dose and Christian Gla{\ss}er and Larissa Michler and Marc Technau},
  booktitle={MFCS},
  year={2017}
}
We study the computational complexity of emptiness problems for circuits over sets of natural numbers with the operations union, intersection, complement, addition, and multiplication. For most settings of allowed operations we precisely characterize the complexity in terms of completeness for classes like NL, NP, and PSPACE. The case where intersection, addition, and multiplication is allowed turns out to be equivalent to the complement of polynomial identity testing (PIT). Our results… 

Tables from this paper

Balance Problems for Integer Circuits
  • Titus Dose
  • Mathematics, Computer Science
    Electron. Colloquium Comput. Complex.
  • 2018
TLDR
The work shows that the balance problem for { ∖, ⋅ } -circuits is undecidable which is the first natural problem for integer circuits or related constraint satisfaction problems that admits only one arithmetic operation and is proven to be Undecidable.
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic
  • Theor. Comput. Sci.
  • 2017

References

SHOWING 1-10 OF 46 REFERENCES
The Complexity of Membership Problems for Circuits over Sets of Positive Numbers
TLDR
It is shown that the membership problem for the general case and for (∪∩,+,×) is PSPACE-complete, whereas it is NEXPTIME-hard if one allows 0, and several other cases are resolved.
Equivalence Problems for Circuits over Sets of Natural Numbers
TLDR
This work gives a systematic characterization of the complexity of equivalence problems over sets of natural numbers and provides an improved upper bound for the case of {∪,∩,−,+,×}-circuits.
Arithmetic Circuits: A survey of recent results and open questions
TLDR
The goal of this monograph is to survey the field of arithmetic circuit complexity, focusing mainly on what it finds to be the most interesting and accessible research directions, with an emphasis on works from the last two decades.
Integer circuit evaluation is PSPACE-complete
  • Ke Yang
  • Mathematics
    Proceedings 15th Annual IEEE Conference on Computational Complexity
  • 2000
TLDR
The integer circuit problem is PSPACE-complete, resolving an open problem posed by P. McKenzie, H. Vollmer, and K. W. Wagner (2000).
Arithmetic Circuits and Counting Complexity Classes
TLDR
Innovative work by Kabanets and Impagliazzo shows that, in some cases, providing lower bounds on arithmetic circuit size can yield consequences about Boolean complexity classes, which are intimately linked to the arithmetic complexity of the Permanent.
Word problems requiring exponential time(Preliminary Report)
TLDR
A number of similar decidable word problems from automata theory and logic whose inherent computational complexity can be precisely characterized in terms of time or space requirements on deterministic or nondeterministic Turing machines are considered.
Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers
  • Titus Dose
  • Mathematics, Computer Science
    Electron. Colloquium Comput. Complex.
  • 2016
TLDR
The computational complexity of constraint satisfaction problems that are based on integer expressions and algebraic circuits, such as L, P, NP, PSPACE, NEXP, and even Sigma_1, the class of c.e. languages, is studied.
Constraint Satisfaction Problems around Skolem Arithmetic
TLDR
This work studies interactions between Skolem Arithmetic and certain classes of Constraint Satisfaction Problems (CSPs) and proves the decidability of SkoleM Arithmetic.
Dominoes and the Complexity of Subclasses of Logical Theories
Progress on Polynomial Identity Testing
TLDR
Nitin Saxena gives in this survey a beautiful overview of several recent results dealing with the complexity of Polynomial Identity Testing.
...
...