๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press seventh annual ACM symposium - Albuquerque, New Mexico, United States (1975.05.05-1975.05.07)] Proceedings of seventh annual ACM symposium on Theory of computing - STOC '75 - Two applications of a probabilistic search technique

โœ Scribed by Fredman, Michael L.

Book ID
123607444
Publisher
ACM Press
Year
1975
Weight
270 KB
Category
Article

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[ACM Press the thirty-seventh annual ACM
[ACM Press the thirty-seventh annual ACM symposium - Baltimore, MD, USA (2005.05.22-2005.05.24)] Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05 - Undirected ST-connectivity in log-space
โœ Reingold, Omer ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› ACM Press ๐ŸŒ English โš– 203 KB

We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log 4/3 obtained by Armoni, Ta-Shma, Wigderson and Zhou [9]. As undirected st-connectivity is complete for the class of probl