Opening book details…
Can I read Comparing Complexity Classes on EtoBox?
Comparing Complexity Classes by Ronald V. Book is a Computer Science article available to read on EtoBox.
What is Comparing Complexity Classes about?
Complexity classes defined by time-bounded and space-bounded Turing acceptors are studied in order to learn more about the cost of deterministic simulation of nondeterministic processes and about time-space tradeoffs. Here complexity classes are compared by means of reducibilities and class-complete sets. The classes studied are defined by bounds of the order n, n ~, 2 n, 2 n~. The results do not establish the existence of possible relationships between these classes; rather, they show the consequences of such relationships, in some cases offering circumstantial evidence that these relationships do not hold and that certain pairs of classes are set-theoretically incomparable.
Who reads Comparing Complexity Classes?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Ronald V. Book
- Publisher
- Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0022-0000)
- Published
- 1974
- Language
- EN
- Field
- Computer Science (Physical Sciences)