Zusammenfassung
Gegenstand dieses Kapitels ist das Verhältnis der Ressourcen Zeit und Speicherplatz zueinander. Wir hatten bereits im ersten Kapitel die Beziehungen
hergeleitet (Korollar 1.4.9 und Aufgabe 1.5.26). Für 1-Band DTM mit Zeitschranken T ≥ Ω(N log N) läßt sich die erste Relation gemäß Aufgabe 3.7.10 verbessern zu
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur
R. Book, On Languages Accepted in Polynomial Time, SIAM J. Comput. 1, 1972, 281–287.
A. Borodin, S. Cook, A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation, SIAM J. Comput. 11, 1982, 287–297.
S. Cook, Characterizations of Pushdown Machines in Terms of Time-Bounded Computers, J. ACM 18, 1971, 4–18.
S. Cook, An Observation on Time-Storage Trade Off, J. CSS 9, 1974, 4–18.
S. Cook, R. Sethi, Storage Requirements for Deterministic Polynomial Time Recognizable Languages, J. CSS 13, 1976, 25–37.
D. Carlson, J. Savage, Size-Space Tradeoffs for Oblivious Computations, J. CSS 26, 1983, 65–81.
P. Dymond, S. Cook, Complexity Theory of Parallel Time and Hardware, I&C 80, 1989, 205–226.
P. Duris, Z. Galil, A Time-Space Tradeoff for Language Recognition, MST 17, 1984, 3–12.
O. Gabber, Z. Galil, Explicit Constructions of Linear Size Superconcentrators, J. CSS 22, 1981, 407–420.
J. Hong, A Tradeoff Theorem for Space and Reversal, TCS 32, 1984, 221–224.
J. Hong, H. Kung, I/O Complexity: The Red-Blue Pebble Game, Proc. 13. SToC, 1981, 326–333.
J. Halpern, M. Loui, A. Meyer, D. Weise, On Time versus Space III, MST 19, 1986, 13–28.
J. Hopcroft, W. Paul, L. Valiant, On Time versus Space, J. ACM 24, 1977, 32–337.
J. Hopcroft, J. Ullman, Relations between Time and Tape Complexities, J. ACM 15, 1968, 414–427.
O. Ibara, S. Moran, Some Time-Space Tradeoff Results Concerning Single-Tape and Offline Turing Machines, SIAM J. Comput. 12, 1983, 388–394.
J. JaJa, Time-Space Tradeoffs for Some Algebraic Problems, J. ACM 30, 1983, 657–667.
M. Klawe, A Tight Bound for the Black and White Pebble Game on the Pyramid, J. ACM 32, 1985, 218–228.
M. Karchmer, Two Time-Space Tradeoffs for Element Distinctness, TCS 47, 1986, 237–246.
B. Kalyanasundaram, G. Schnitger, On the Power of White Pebbles, Proc. 20. SToC, 1988, 258–266.
M. Loui, A Note on the Pebble Game, IPL 11, 1980, 24–26.
M. Loui, A Space Bound for 1-Tape Multidimensional Turing Machines, TCS 15, 1981, 311–320.
K. Lorys, M. Liskiewicz, Two Applications of Fiirer’s Counter to 1-Tape NTM, Proc. 13. MFCS, 1988, 445–453.
M. Liskiewicz, K. Lorys, Fast Simulations of Time-Bounded 1-Tape TM by Space-Bounded Ones, SIAM J. Comput. 19, 1990, 511–521.
R. Lipton, R. Tarjan, A Separator Theorem for Planar Graphs, SIAM J. Appl. Math. 36, 1979, 177–189.
T. Lengauer, R. Tarjan, Asymptotic Tight Bounds on Time-Space Tradeoffs in a Pebble Game, J. ACM 29, 1982, 1087–1130.
G. Lev, L. Valiant, Size Bounds on Superconcentrators, TCS 22, 1983, 233–251.
F. Meyeraufder Heide, A Comparison between 2 Variations of a Pebble Game on Graphs, TCS 13, 1981, 315–322.
E. Moriya, S. Iwata, T. Kasai, A Note on Some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines, I&C 70, 1986, 179–185.
M. Paterson, Tape Bounds for Time-Bounded TM, J. CSS 6, 1972, 116–124.
N. Pippenger, Superconcentrators, SIAM J. Comput. 6, 1977, 298–304.
N. Pippenger, A Time-Space Trade-Off, J. ACM 25, 1978, 509–515.
N. Pippenger, On Simultaneous Resource Bounds, Proc. 20. FoCS, 1979, 307–311.
N. Pippenger, Pebbling with Auxiliary Pushdowns, J. CSS 23, 1981, 151–165.
N. Pippenger, Advances in Pebbling, Proc. 9. ICALP, 1982, 407–417.
W. Paul, R. Reischuk, On Time versus Space II, J. CSS 12, 1981, 312–327.
W. Paul, R. Tarjan, Time-Space Trade-Offs in a Pebble Game, Acta Inf. 10, 1978, 111–115.
W. Paul, R. Tarjan, J. Celoni, Space Bounds for a Game on Graphs, MST 10, 1977, 239–251.
R. Reischuk, Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game, J. ACM 27, 1980, 839–849.
R. Sethi, Complete Register Allocation Problems, SIAM J. Comput. 4, 1975, 226–248.
M. Tompa, Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits, J. CSS 20, 1980, 118–132.
L. Valiant, Graph Theoretic Properties in Computational Complexity, J. CSS 13, 1976, 278–285.
I. Wegener, Time-Space Tradeoffs for Branching Programs, J. CSS 32, 1986, 91–96.
Y. Yesha, Time-Space Tradeoffs for Matrix Multiplication and the Discrete Fourier Transform on any General Sequential Random-Access Computer, J. CSS 29, 1982, 183–197.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 B. G. Teubner Stuttgart · Leipzig
About this chapter
Cite this chapter
Reischuk, K.R. (1999). Zeit- versus Platzkomplexität. In: Komplexitätstheorie Band I: Grundlagen. Leitfäden der Informatik. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-80139-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-322-80139-5_5
Publisher Name: Vieweg+Teubner Verlag
Print ISBN: 978-3-519-12275-3
Online ISBN: 978-3-322-80139-5
eBook Packages: Springer Book Archive