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

Uloženo v:
Podrobná bibliografie
Vydáno v:27th Annual Symposium on Foundations of Computer Science (sfcs 1986) s. 348 - 360
Hlavní autoři: Venkateswaran, H., Tompa, Martin
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.10.1986
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:0818607408
9780818607400
ISSN:0272-5428
DOI:10.1109/SFCS.1986.2