# Balance Problems for Integer Circuits

@inproceedings{Dose2018BalancePF, title={Balance Problems for Integer Circuits}, author={Titus Dose}, booktitle={Electron. Colloquium Comput. Complex.}, year={2018} }

Abstract We investigate the computational complexity of balance problems for { ∖ , ⋅ } -circuits computing finite sets of natural numbers. These problems naturally build on problems for integer expressions and integer circuits studied by Stockmeyer and Meyer (1973), McKenzie and Wagner (2007), and Glaser et al. (2010). Our work shows that the balance problem for { ∖ , ⋅ } -circuits is undecidable which is the first natural problem for integer circuits or related constraint satisfaction problems…

## References

SHOWING 1-10 OF 21 REFERENCES

Emptiness Problems for Integer Circuits

- MathematicsMFCS
- 2017

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.

Integer circuit evaluation is PSPACE-complete

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

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

- MathematicsFCT
- 2007

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.

Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers

- Mathematics, Computer ScienceElectron. 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.

Functions Definable by Arithmetic Circuits

- Mathematics, Computer ScienceCiE
- 2009

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.

Word problems requiring exponential time(Preliminary Report)

- Computer Science, MathematicsSTOC
- 1973

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.

The complexity of theorem-proving procedures

- Mathematics, Computer ScienceSTOC
- 1971

It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a…

On the number of integers in a generalized multiplication table

- Mathematics
- 2014

Motivated by the Erdos multiplication table problem we study the following question: Given numbers N_1,...,N_{k+1}, how many distinct products of the form n_1...n_{k+1} with n_i 1. In the present…

A survey on counting classes

- MathematicsProceedings Fifth Annual Structure in Complexity Theory Conference
- 1990

The authors prove P/sup EP(log)/ 25 PP, investigate the Boolean closure BC( EP) of EP, and give a relativization principle which allows them to completely separate BC(EP) in a suitable relativized world and to give simple proofs for known relativizing results.

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

- Mathematicscomputational complexity
- 2007

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.