Lower bounds by Kolmogorov-complexity:

Using Kolmogorov-complexity, we obtain the following new lower bounds

Saved in:
Bibliographic Details
Main Author: Li, Ming (Author)
Format: Book
Language:English
Published: Ithaca, NY 1985
Series:Cornell University <Ithaca, NY> / Dept. of Computer Science: Technical report 666.
Subjects:
Summary:Using Kolmogorov-complexity, we obtain the following new lower bounds
For on-line nondeterministic Turing machines
(1) simulating 2 pushdown stores by 1 tape requires
Physical Description:26 S.

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!