## Abstract

Simultaneous resource bounded complexity classes for nondeterministic single worktape off-line Turing machines are considered such as time-space bounded classes, denoted by NTISP_{1}(T, S), reversal-space bounded classes, denoted by NRESP_{1}(R, S), and time-reversal bounded classes, denoted by NTIRE_{1}(T, R). It is shown that NRESP_{1}(R(n), S(n)) contains NTISP_{1}(S(n), R(n)) and is contained in NTISP_{1}(R(n) S(n)n^{2} log n, R(n) log n). The following corollaries follow: (1) the affirmative solution to the nondeterministic single worktape version of the NC = ? SC problem, NTIRE_{1}(poly, polylog) = NTISP_{1}(poly, polylog), and (2) a reversal-space trade-off, NRESP_{1}(polylog, poly) = NRESP_{1}(poly, polylog).

Original language | English |
---|---|

Pages (from-to) | 179-185 |

Number of pages | 7 |

Journal | Information and control |

Volume | 70 |

Issue number | 2-3 |

DOIs | |

Publication status | Published - 1986 |

Externally published | Yes |

## ASJC Scopus subject areas

- Engineering(all)