A New Pebble Game that Characterizes Parallel Complexity Classes

A new two-person pebble game that models parallel computations is defined. This game extends the two-person pebble game defined by Dymond and Tompa [J. Comput. System Sci., 30 (1985), pp. 149-161] and is used to characterize two natural parallel complexity classes, namely LOGCFL and ${\text{AC}}^1 $...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on computing Vol. 18; no. 3; pp. 533 - 549
Main Authors:	Venkateswaran, H., Tompa, Martin
Format:	Journal Article
Language:	English
Published:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.06.1989
Subjects:	Algorithms Applied sciences Boolean Circuits Complexity theory Computer science Computer science; control theory; systems Exact sciences and technology Games Language theory and syntactical analysis Theoretical computing Characterization Pebble game Complexity class Language theory Language class Computer theory Two person game Parallelism Modeling Computing complexity
ISSN:	0097-5397, 1095-7111
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!