Symmetric space-bounded computation

Lewis, HR; Papadimitriou, CH

dc.contributor.author	Lewis, HR	en
dc.contributor.author	Papadimitriou, CH	en
dc.date.accessioned	2014-03-01T01:06:06Z
dc.date.available	2014-03-01T01:06:06Z
dc.date.issued	1982	en
dc.identifier.issn	0304-3975	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9162
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0001667057&partnerID=40&md5=6e68c3f81eaa915fc95f0fb64e588150	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.title	Symmetric space-bounded computation	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1982	en
heal.abstract	A symmetric Turing machine is one such that the ""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. © 1982.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Theoretical Computer Science	en
dc.identifier.isi	ISI:A1982NY07200003	en
dc.identifier.volume	19	en
dc.identifier.issue	2	en
dc.identifier.spage	161	en
dc.identifier.epage	187	en