REVERSAL COMPLEXITY.

Jian er Chen, Chee Yap

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Some basic techniques necessary for establishing analogs of well-known theorems on space and time complexity are developed. The main results are that for reversal-constructible functions s(n) greater than equivalent to log n, DSPACE(s(n)) 25 DREVERSAL(s(n)) and the first tape-reduction theorem. As applications of the tape reduction theorem, a hierarchy theorem is proved and the existence of complete languages for reversal complexity is shown.

Original languageEnglish (US)
Title of host publicationUnknown Host Publication Title
PublisherIEEE
Pages14-19
Number of pages6
ISBN (Print)0818607947
StatePublished - 1987

Fingerprint

Tapes

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Chen, J. E., & Yap, C. (1987). REVERSAL COMPLEXITY. In Unknown Host Publication Title (pp. 14-19). IEEE.

REVERSAL COMPLEXITY. / Chen, Jian er; Yap, Chee.

Unknown Host Publication Title. IEEE, 1987. p. 14-19.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chen, JE & Yap, C 1987, REVERSAL COMPLEXITY. in Unknown Host Publication Title. IEEE, pp. 14-19.
Chen JE, Yap C. REVERSAL COMPLEXITY. In Unknown Host Publication Title. IEEE. 1987. p. 14-19
Chen, Jian er ; Yap, Chee. / REVERSAL COMPLEXITY. Unknown Host Publication Title. IEEE, 1987. pp. 14-19
@inproceedings{4f9b916bee404334a4d1ea73583e602a,
title = "REVERSAL COMPLEXITY.",
abstract = "Some basic techniques necessary for establishing analogs of well-known theorems on space and time complexity are developed. The main results are that for reversal-constructible functions s(n) greater than equivalent to log n, DSPACE(s(n)) 25 DREVERSAL(s(n)) and the first tape-reduction theorem. As applications of the tape reduction theorem, a hierarchy theorem is proved and the existence of complete languages for reversal complexity is shown.",
author = "Chen, {Jian er} and Chee Yap",
year = "1987",
language = "English (US)",
isbn = "0818607947",
pages = "14--19",
booktitle = "Unknown Host Publication Title",
publisher = "IEEE",

}

TY - GEN

T1 - REVERSAL COMPLEXITY.

AU - Chen, Jian er

AU - Yap, Chee

PY - 1987

Y1 - 1987

N2 - Some basic techniques necessary for establishing analogs of well-known theorems on space and time complexity are developed. The main results are that for reversal-constructible functions s(n) greater than equivalent to log n, DSPACE(s(n)) 25 DREVERSAL(s(n)) and the first tape-reduction theorem. As applications of the tape reduction theorem, a hierarchy theorem is proved and the existence of complete languages for reversal complexity is shown.

AB - Some basic techniques necessary for establishing analogs of well-known theorems on space and time complexity are developed. The main results are that for reversal-constructible functions s(n) greater than equivalent to log n, DSPACE(s(n)) 25 DREVERSAL(s(n)) and the first tape-reduction theorem. As applications of the tape reduction theorem, a hierarchy theorem is proved and the existence of complete languages for reversal complexity is shown.

UR - http://www.scopus.com/inward/record.url?scp=0023171209&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023171209&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0023171209

SN - 0818607947

SP - 14

EP - 19

BT - Unknown Host Publication Title

PB - IEEE

ER -