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

  title={The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers},
  author={Pierre McKenzie and Klaus W. Wagner},
  journal={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… 

Equations over Sets of Natural Numbers with Addition Only

It is shown that for every recursive (r.e.) set $S \subseteq \mathbb{N}$ there exists a system with a unique (least, greatest) solution containing a component $T$ with $S=\ensuremath{ \{ n \: | \: 16n+13 \in T \} }$.

Representing Hyper-arithmetical Sets by Equations over Sets of Integers

The results settle the expressive power of the most general types of language equations, as well as equations over subsets of free groups, over sets of natural numbers equipped with union, addition and subtraction.

On equations over sets of integers

The class of sets representable by unique solutions of equations using the operations of union and addition using ultimately periodic constants is exactly the class of hyper-arithmetical sets.

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.

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.

Satisfiability of algebraic circuits over sets of natural numbers

Unambiguous Conjunctive Grammars over a One-Letter Alphabet

It is demonstrated that unambiguous conjunctive grammars over a unary alphabet Σ = {a} have non-trivial expressive power, and that their basic properties are undecidable. The key result is that for

Equivalence Problems for Circuits over Sets of Natural Numbers

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.

Complexity of solutions of equations over sets of natural numbers

The general membership problem for these equations is proved to be EXPTIME-complete and it is established that least solutions of all such systems are in EXPTime.

Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers

  • D. Meister
  • Mathematics, Computer Science
    Theory of Computing Systems
  • 2007
The set of operations from which functions are built and the impact on the complexity of the membership problems for special finite recurrent systems for PSPACE-decidable membership problems are focused on and completeness results for the complexity classes NL, NP and PSPACE are shown.



Finite Moniods: From Word to Circuit Evaluation

It is shown that circuit evaluation in the case of any nonsolvable monoid is $P$ complete, while circuits over solvable monoids can be evaluated in $DET \subseteq NC^2$.

The monotone and planar circuit value problems are log space complete for P

It is shown that Ladner's simulation of Turing mac]hines by boolean circuits seems to require an "adequate" set of gates, such as AND and NOT, but the same simulation is possible with monotone circuits using AND and OR gates only.

Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs

If Q is an inftmte field (e.g, the rauonal numbers or the complex numbers), then the equwalence problem for ~ is probabilistlcally decidable in polynomml time and the equivalence problem is NP-hard.

An Optimal Parallel Algorithm for Formula Evaluation

A new approach to Buss’s NC 1 algorithm for evaluation of Boolean formulas is presented and is used to solve the more general problem of evaluating arithmetic formulas by using arithmetic circuits.

Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds

It is shown that the perfect matching problem is in the complexity class SPL (in the nonuniform setting), and if there are problems in DSPACE(n) requiring exponential-size circuits, then all of the results hold in the uniform setting.

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.

Uniform circuits for division: consequences and problems

Tight bounds are obtained on the uniformity required for division, by showing that division is complete for the complexity class FOM+POW obtained by augmenting FOM with a predicate for powering modulo small primes, and it is shown that, under a well-known number-theoretic conjecture, POW lies in FOM.

Computing Algebraic Formulas Using a Constant Number of Registers

It is shown that, over an arbitrary ring, the functions computed by polynomial-size algebraic formulas are also computed by algebraic straight-line programs that use only three registers, which is an improvement over previous methods that require the number of registers to be logarithmic in the size of the formulas.