Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations

Martin Tompa. Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations. SIAM Journal on Computing, 11(1):130-137, 1982.

Abstract

Abstract is missing.