Size Matters: Logarithmic Space is Real Time

We show that all the problems solvable by a nondeterministic machine with logarithmic work space (NL) can be solved in real time by a parallel machine, no matter how tight the real-time constraints are. We also show that several other real-time problems are in effect solvable in nondeterministic log...

Celý popis

Podrobná bibliografia

Vydané v:	International journal of computers & applications Ročník 29; číslo 4; s. 327 - 336
Hlavní autori:	Bruda, S.D., Akl, S.G.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Calgary Taylor & Francis 2007 Taylor & Francis Ltd
Predmet:	Algorithms Buses Conflict resolution independence system Languages matroid Optimization parallel complexity Power Real time Real-time computation reconfigurable multiple bus machine Studies timed ω-language
ISSN:	1206-212X, 1925-7074
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!