Integer Circuit evaluation is PSPACE-complete

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2000, Pages 204-211

  Yang, Ke ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER AIDED NETWORK ANALYSIS; COMPUTER SIMULATION; POLYNOMIALS; THEOREM PROVING;

INTEGER CIRCUITS; POLYNOMIAL REPLACEMENT SYSTEMS; QUANTIFIED BOOLEAN FORMULA (QBF); SOFTWARE PACKAGE PSPACE;

COMPUTATIONAL COMPLEXITY;

EID: 0033698442     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)