Searching for "Relationships Between Nondeterministic and Deterministic Tape Complexities." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

M. Tompa. Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations. SIAM Journal on Computing, 11(1):130-137, Feb. 1982.
by Wrathall Complete Sets, R. L. Rivest A. Shamir, L. Adleman, J. H. Reif Depth
… and System Sciences, 22(3):365-383, June 1981. [40] W. J. Savitch. Relationships between nondeterministic…
Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB