Symmertric space-bounded computation (extended abstract)

  • Harry R. Lewis
  • Christos H. Papadimitriou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1980

Authors and Affiliations

  • Harry R. Lewis
    • 1
  • Christos H. Papadimitriou
    • 2
  1. 1.Aiken Computation LaboratoryHarvard UniversityCambridge
  2. 2.Department of Electrical Engineering and Computer ScienceMassachusetts Institute of TechnologyCambridge

Personalised recommendations