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… 

The Complexity of Membership Problems for Circuits over Sets of Positive Numbers

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.

Balance Problems for Integer Circuits

  • Titus Dose
  • Mathematics, Computer Science
    Electron. Colloquium Comput. Complex.
  • 2018
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.

Emptiness Problems for Integer Circuits

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.

Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers

  • Titus Dose
  • Mathematics, Computer Science
    Electron. Colloquium Comput. Complex.
  • 2016
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.

Complexity of Equations over Sets of Natural Numbers

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.

Functions Definable by Arithmetic Circuits

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.

Circuit satisfiability and constraint satisfaction around Skolem Arithmetic

Constraint Satisfaction Problems around Skolem Arithmetic

This work studies interactions between Skolem Arithmetic and certain classes of Constraint Satisfaction Problems (CSPs) and proves the decidability of SkoleM Arithmetic.

Unary Pushdown Automata and Straight-Line Programs

The results imply Π2 P-completeness for a natural fragment of Presburger arithmetic and coNP lower bounds for compressed matching problems with one-character wildcards.

References

SHOWING 1-10 OF 24 REFERENCES

The Complexity of Membership Problems for Circuits over Sets of Positive Numbers

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.

The complexity of membership problems for circuits over sets of integers

Integer circuit evaluation is PSPACE-complete

  • Ke Yang
  • Mathematics
    Proceedings 15th Annual IEEE Conference on Computational Complexity
  • 2000
The integer circuit problem is PSPACE-complete, resolving an open problem posed by P. McKenzie, H. Vollmer, and K. W. Wagner (2000).

Word problems requiring exponential time(Preliminary Report)

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.

Relationships among PL, #L, and the determinant

  • E. AllenderM. Ogihara
  • Mathematics
    Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory
  • 1994
A very simple proof of a theorem of Jung (1985) is given, showing that probabilistic logspace-bounded (PL) machines lose none of their computational power if they are restricted to run in polynomial time.

On the Boolean closure of NP

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.

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

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.

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 (+,*,⋎)

On the Tape Complexity of Deterministic Context-Free Languages

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).

Making computation count: arithmetic circuits in the nineties

This issue's expert guest column is by Eric Allender, who has just taken over the Structural Complexity Column in the Bulletin of the EATCS, and points out that, while the journal does not require the "alpha" citation style, it does strongly advise authors to use that style.