Title :
A new pebble game that characterizes parallel complexity classes
Author :
Venkateswaran, H. ; Tompa, Martin
Abstract :
A new two-person pebble game that models parallel computations is defined. This game extends the two-person pebble game defined in [DT85] and is used to characterize two natural parallel complexity classes, namely LOGCFL and AG1. The characterizations show a fundamental way in which the computations in these two classes differ. This game model also unifies the proofs of some well known results of complexity theory.
Keywords :
Circuits; Complexity theory; Computational modeling; Computer science; Concurrent computing; Game theory; Phase change random access memory; Polynomials; Switches; Turing machines;
Conference_Titel :
Foundations of Computer Science, 1986., 27th Annual Symposium on
Conference_Location :
Toronto, ON, Canada
Print_ISBN :
0-8186-0740-8
DOI :
10.1109/SFCS.1986.2
