Two Familiar Transitive Closure Algorithms which Admit No Polynomial Time, Sublinear Space Implementations - researchr publication

researchr

You are not signed in
Sign in
Sign up

Martin Tompa. Two Familiar Transitive Closure Algorithms which Admit No Polynomial Time, Sublinear Space Implementations. In Conference Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, 28-30 April, Los Angeles, California, USA. pages 333-338, ACM, 1980.

Abstract is missing.

runs on WebDSL