Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computational complexity theory, Savitch''s theorem, proved by Walter Savitch in 1970, states that for any function ƒ(n) ≥ log(n). In other words, if a nondeterministic Turing machine can solve a problem using f(n) space, an ordinary deterministic Turing machine can solve the same problem in the square of that space bound. Although it seems that nondeterminism may produce exponential gains in time, this theorem shows that it has a markedly more limited effect on space requirements.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -High Quality Content by WIKIPEDIA articles! In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, states that for any function (n) log(n). In other words, if a nondeterministic Turing machine can solve a problem using f(n) space, an ordinary deterministic Turing machine can solve the same problem in the square of that space bound. Although it seems that nondeterminism may produce exponential gains in time, this theorem shows that it has a markedly more limited effect on space requirements. 96 pp. Englisch. N° de réf. du vendeur 9786131154805
Quantité disponible : 2 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, states that for any function (n) log(n). In other words, if a nondeterministic Turing machine can solve a problem using f(n) space, an ordinary deterministic Turing machine can solve the same problem in the square of that space bound. Although it seems that nondeterminism may produce exponential gains in time, this theorem shows that it has a markedly more limited effect on space requirements. N° de réf. du vendeur 9786131154805
Quantité disponible : 1 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In computationalcomplexity theory, Savitch's theorem, proved by Walter Savitch in 1970states that for any function ¿(n) ¿ log(n). In other words, if anondeterministic Turing machine can solve a problem using f(n) space, anordinary deterministic Turing machine can solve the same problem in thesquare of that space bound. Although it seems that nondeterminism mayproduce exponential gains in time, this theorem shows that it has amarkedly more limited effect on space requirements.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 96 pp. Englisch. N° de réf. du vendeur 9786131154805
Quantité disponible : 1 disponible(s)