Reversal complexity revisited

We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r ( n ) , there are several further tapes on which head reversals remain unrestricted, but size is bounded by s ( n ) (where n denotes the input leng...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 401; číslo 1; s. 191 - 205
Hlavní autoři:	Hernich, André, Schweikardt, Nicole
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 23.07.2008 Elsevier
Témata:	Algorithmics. Computability. Computer arithmetics Applied sciences Automata. Abstract machines. Turing machines Computer science; control theory; systems Data processing. List processing. Character string processing Exact sciences and technology Hierarchies of complexity classes Memory organisation. Data processing Miscellaneous Reversal-bounded and space-bounded Turing machines Software Theoretical computing Reversal-bounded and space-bounded Turing machines Hierarchies of complexity classes Lower bound Complexity class Evaluation Computer theory Query Memory Turing machine Resource Space time Circuit complexity AND circuit Sorting Trade Hierarchy Input Turing machines Query processing Computer Reversal-bounded and space-bounded Formalization
ISSN:	0304-3975, 1879-2294
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!

Buďte první, kdo okomentuje tento záznam!