Searching for "Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations." – 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
by Wrathall Complete Sets, R. L. Rivest A. Shamir, L. Adleman, J. H. Reif Depth
… [47] M. Tompa. Two familiar transitive closure algorithms which admit no polynomial time…
Add To MetaCart

Showing 1 through 1.

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