loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
15th Annual IEEE Conference on Computational Complexity (CoCo'00)
Integer Circuit Evaluation is PSPACE-Complete
Florence, Italy
July 04-July 07
ISBN: 0-7695-0674-7
ASCII Text
x 
 
Ke Yang, "Integer Circuit Evaluation is PSPACE-Complete," Computational Complexity, Annual IEEE Conference on, pp. 204, 15th Annual IEEE Conference on Computational Complexity (CoCo'00), 2000.
 
 
BibTex
x
 
@article{ 10.1109/CCC.2000.856751,
author = {Ke Yang},
title = {Integer Circuit Evaluation is PSPACE-Complete},
journal ={Computational Complexity, Annual IEEE Conference on},
volume = {0},
year = {2000},
issn = {1093-0159},
pages = {204},
doi = {http://doi.ieeecomputersociety.org/10.1109/CCC.2000.856751},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computational Complexity, Annual IEEE Conference on
TI - Integer Circuit Evaluation is PSPACE-Complete
SN - 1093-0159
SP
EP
A1 - Ke Yang,
PY - 2000
KW - Integer Circuit
KW - PSPACE
KW - Chinese Remainder Theorem
VL - 0
JA - Computational Complexity, Annual IEEE Conference on
ER -
 
Ke Yang, Carnegie Mellon University
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 studied by Mckenzie, Vollmer and Wagner in their “Polynomial Replacement System”. We show a polynomial-time algorithm that reduces QBF (Quantified Boolean Formula) problem to the Integer Circuit problem. This complements the result of Wagner to show that IC problem is PSPACE-complete. The proof in this paper provides a new perspective to describe PSPACE-completeness.
Index Terms:
Integer Circuit, PSPACE, Chinese Remainder Theorem
Citation:
Ke Yang, "Integer Circuit Evaluation is PSPACE-Complete," ccc, pp.204, 15th Annual IEEE Conference on Computational Complexity (CoCo'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.