Integer circuit evaluation is PSPACE-complete

  title={Integer circuit evaluation is PSPACE-complete},
  author={Ke Yang},
  journal={Proceedings 15th Annual IEEE Conference on Computational Complexity},
  • Ke Yang
  • Published 2000
  • Mathematics, Computer Science
  • Proceedings 15th Annual IEEE Conference on Computational Complexity
In this paper, we address the problem of evaluating the integer circuit (IC), or the {U,/spl times/,+}-circuit over the set of natural numbers. The problem is a natural extension to the integer expression by L.J. Stockmeyer and A.R. Mayer (1973); and is also studied by P. Mckenzie et al. (1999) in their "Polynomial Replacement System". We show a polynomial-time algorithm that reduces QBP (quantified Boolean formula) problem to the integer circuit problem. This complements the result of K.W… Expand
Balance Problems for Integer Circuits
  • Titus Dose
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 2018
The complexity of membership problems for circuits over sets of integers
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic
Equivalence Problems for Circuits over Sets of Natural Numbers
Functions Definable by Arithmetic Circuits


Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds
Sparse Complex Polynomials and Polynomial Reducibility
  • D. Plaisted
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1977
Greatest common divisors of polynomials given by straight-line programs
PSPACE survives three-bit bottlenecks