Find out how to access previewonly content
Automata, Languages and Programming
Volume 85 of the series Lecture Notes in Computer Science pp 374384
Date:
Symmertric spacebounded computation (extended abstract)
 Harry R. LewisAffiliated withAiken Computation Laboratory, Harvard University
 , Christos H. PapadimitriouAffiliated withDepartment of Electrical Engineering and Computer Science, Massachusetts Institute of Technology
Abstract
A symmetric Turing machine is one whose "yields" relation between configurations is symmetric. The space complexity classes for such machines are found to be intermediate between the corresponding deterministic and nondeterministic space complexity classes. Certain natural problems are shown to be complete for symmetric space complexity classes, and the relationship of symmetry to determinism and nondeterminism is investigated.
 Title
 Symmertric spacebounded computation (extended abstract)
 Book Title
 Automata, Languages and Programming
 Book Subtitle
 Seventh Colloquium Noordwijkerhout, the Netherlands July 14–18, 1980
 Pages
 pp 374384
 Copyright
 1980
 DOI
 10.1007/3540100032_85
 Print ISBN
 9783540100034
 Online ISBN
 9783540393467
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 85
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 Harry R. Lewis ^{(1)}
 Christos H. Papadimitriou ^{(2)}
 Author Affiliations

 1. Aiken Computation Laboratory, Harvard University, 02138, Cambridge, Mass.
 2. Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, Mass.
Continue reading...
To view the rest of this content please follow the download PDF link above.