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,Π2P, PSPACE, NEXP, and beyond. McKenzie and Wagner (2003) studied… Expand
Emptiness problems for integer circuits
TLDR
It turns out that the following problems are equivalent to PIT, which shows that the challenge to improve their bounds is just a reformulation of a well-studied, major open problem in algebraic computing complexity. Expand
Balance problems for integer circuits
  • Titus Dose
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2019
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. Expand
Balance Problems for Integer Circuits
  • Titus Dose
  • Computer Science, Mathematics
  • 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. Expand
Emptiness Problems for Integer Circuits
TLDR
It turns out that the following problems are equivalent to PIT, which shows that the challenge to improve their bounds is just a reformulation of a major open problem in algebraic computing complexity. Expand
Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers
  • Titus Dose
  • Computer Science, Mathematics
  • 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. Expand
Complexity of Equations over Sets of Natural Numbers
TLDR
The general membership problem for equations of the form Xi=φi (X1,…,Xn) (1≤i≤n) is proved to be EXPTIME-complete, and it is established that least solutions of all such systems are in EXPTime. Expand
Functions Definable by Arithmetic Circuits
TLDR
Two negative results are proved: the first shows, roughly, that a function is not circuit-definable if it has an infinite range and sub-linear growth; the second shows,roughly, that it has a finite range and fails to converge on certain `sparse' chains under inclusion. Expand
Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic
We study interactions between Skolem Arithmetic and certain classes of Circuit Satisfiability and Constraint Satisfaction Problems (CSPs). We revisit results of Glaser et al. [16] in the context ofExpand
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic
Abstract We study interactions between Skolem Arithmetic and certain classes of Circuit Satisfiability and Constraint Satisfaction Problems (CSPs). We revisit results of Glaser et al. [1] in theExpand
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. Expand
...
1
2
...

References

SHOWING 1-10 OF 28 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. Expand
The Complexity of Membership Problems for Circuits over Sets of Integers
TLDR
There are several membership problems for which the complexity in the case of integers differs significantly from the cases of the natural numbers: Testing membership in the subset of integers produced at the output of a {∪,+,×}-circuit is NEXPTIME-complete, whereas it is PSPACE-complete for the naturalNumbers. Expand
Integer circuit evaluation is PSPACE-complete
  • Ke Yang
  • Mathematics, Computer Science
  • Proceedings 15th Annual IEEE Conference on Computational Complexity
  • 2000
TLDR
A polynomial-time algorithm is shown that reduces QBP (quantified Boolean formula) problem to the integer circuit problem, which complements the result of K. Wagner (1984) to show that IC problem is PSPACEcomplete. Expand
Relationships Among PL, #L, and the Determinant
TLDR
A very simple proof of theorem of Jung is given, showing that probabilistic logspace-bounded (PL) machines lose none of their computational power if they are restricted to run in polynomial time. Expand
On the Boolean closure of NP
TLDR
New machines whose computational power is bounded by that of alternating Turing machines making only one alternation are introduced whose polynomial time classes are exactly the levels of the Boolean closure of NP which can be defined in a natural way. Expand
Adaptive logspace reducibility and parallel time
TLDR
By imposing appropriate bounds on the number of functional oracle queries made in this computation model, this work obtains new characterizations of the NC and AC hierarchies and solves open questions of Wilson. Expand
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
TLDR
The problem of testing membership in the subset of the natural numbers produced at the output gate of a combinational circuit is shown to capture a wide range of complexity classes, and results extend in nontrivial ways past work by Stockmeyer and Meyer, Wagner, Wagner and Yang. Expand
On the Power of Random Access Machines
We study the power of deterministic successor RAM's with extra instructions like +,*,⋎ and the associated classes of problems decidable in polynomial time. Our main results are NP ... PTIME (+,*,⋎)Expand
Computational Complexity of Probabilistic Turing Machines
  • John Gill
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1977
TLDR
It is shown that every nondeterministic machine can be simulated in the same space by a probabilistic machine with small error probability. Expand
On the Tape Complexity of Deterministic Context-Free Languages
TLDR
A tape hardest deterministic context-free language is described and the best upper bound known on the tape complexity of (deterministic) context- free languages is (log(n) 2). Expand
...
1
2
3
...