|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
20th Annual Symposium on Foundations of Computer Science (FOCS 1979)
On time versus space II
October 29-October 31
| ASCII Text | x | ||
| W. J. Paul, R. Reischuk, "On time versus space II," Foundations of Computer Science, IEEE Annual Symposium on, pp. 298-306, 20th Annual Symposium on Foundations of Computer Science (FOCS 1979), 1979. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1979.30, author = {W. J. Paul and R. Reischuk}, title = {On time versus space II}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1979}, issn = {0272-5428}, pages = {298-306}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1979.30}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - On time versus space II SN - 0272-5428 SP298 EP306 A1 - W. J. Paul, A1 - R. Reischuk, PY - 1979 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1979.30
Logarithmically t(n)-time bounded RAMs can be simulated by t(n)/log t(n)-tape bounded Turing machines, t(n)-time bounded multidimensional multitape Turing machines can be simulated by t(n) loglog t(n)/log t(n)-tape bounded Turing machines.
Citation:
W. J. Paul, R. Reischuk, "On time versus space II," focs, pp.298-306, 20th Annual Symposium on Foundations of Computer Science (FOCS 1979), 1979
Usage of this product signifies your acceptance of the Terms of Use.