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 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...

Celý popis

Podrobná bibliografia

Vydané v:	27th Annual Symposium on Foundations of Computer Science (sfcs 1986) s. 348 - 360
Hlavní autori:	Venkateswaran, H., Tompa, Martin
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.10.1986
Predmet:	Circuits Complexity theory Computational modeling Computer science Concurrent computing Game theory Phase change random access memory Polynomials Switches Turing machines
ISBN:	0818607408, 9780818607400
ISSN:	0272-5428
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!