Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > QUANTIFIED BOOLEAN CIRCUIT:
Reports tagged with Quantified Boolean Circuit:
TR00-012 | 14th February 2000
Ke Yang

#### Integer Circuit Evaluation is PSPACE-complete

In this paper, we address the problem of evaluating the
Integer Circuit (IC), or the $\{\cup, \times, +\}$-circuit over
the set of natural numbers. The problem is a natural extension
to the integer expression by Stockmeyer and Mayer, and is also studied
by Mckenzie, Vollmer and Wagner in ... more >>>

ISSN 1433-8092 | Imprint