Ding‐Zhu Du, Ker‐I Ko
Abstract
Chapter 6 introduces the basic notion of computational complexity, also based on the Turing machine model. It includes the following topics: time and space complexity, complexity classes, hierarchy theorems, nondeterministic Turing machines, and context-sensitive languages.
OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Chapter 6 introduces the basic notion of computational complexity, also based on the Turing machine model. It includes the following topics: time and space complexity, complexity classes, hierarchy theorems, nondeterministic Turing machines, and context-sensitive languages.
Key concepts: Time hierarchy theorem, DTIME, Turing machine, Computer science, Super-recursive algorithm, Nondeterministic algorithm, Computational complexity theory, Theoretical computer science