Abstract
We obtain new catalytic algorithms for space-bounded derandomization. In the catalytic computation model introduced by (Buhrman, Cleve, Koucký, Loff, and Speelman STOC 2013), we are given a small worktape, and a larger catalytic tape that has an arbitrary initial configuration. We may edit this tape, but it must be exactly restored to its initial configuration at the completion of the computation. We prove that
where \(BPSPACE[S]\) corresponds to randomized space S computation, and \(CSPACE[{S},{C}]\) corresponds to catalytic algorithms that use O(S) bits of workspace and O(C) bits of catalytic space. Previously, only \(BPSPACE[S]\subseteq CSPACE[{S},{2^{O(S)}}]\) was known. In fact, we prove a general tradeoff, that for every \(\alpha \in [1,1.5]\),
We do not use the algebraic techniques of prior work on catalytic computation. Instead, we develop an algorithm that branches based on if the catalytic tape is conditionally random, and instantiate this primitive in a recursive framework. Our result gives an alternate proof of the best known time-space tradeoff for \(BPSPACE[S]\), due to (Cai, Chakaravarthy, and van Melkebeek, Theory Comput. Sys. 2006). As a final application, we extend our results to solve search problems in \(CSPACE[{S},{S^2}]\). As far as we are aware, this constitutes the first study of search problems in the catalytic computing model.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Dimitris Achlioptas (2003). Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. Syst. Sci. 66(4), 671–687. URL https://doi.org/10.1016/S0022-0000(03)00025-4.
Sagar Bisoyi, Krishnamoorthy Dinesh & Jayalal Sarma (2022). On pure space vs catalytic space. Theor. Comput. Sci. 921, 112–126. URL https://doi.org/10.1016/j.tcs.2022.04.005.
Harry Buhrman, Richard Cleve, Michal KouckÝ, Bruno Loff & Florian Speelman (2014). Computing with a full memory: catalytic space. In Symposium on Theory of Computing, STOC 2014, 857– 866. ACM.
Harry Buhrman, Michal KouckÝ, Bruno Loff & Florian Speelman (2018). Catalytic Space: Non-determinism and Hierarchy. Theory Comput. Syst. 62(1), 116–135. URL https://doi.org/10.1007/s00224-017-9784-7.
Jin-yi Cai, Venkatesan T. Chakaravarthy & Dieter van Melkebeek (2006). Time-Space Tradeoff in Derandomizing Probabilistic Logspace. Theory Comput. Syst. 39(1), 189–208. URL https://doi.org/10.1007/s00224-005-1264-9.
Kuan Cheng & William M. Hoza (2022). Hitting Sets Give Two- Sided Derandomization of Small Space. Theory of Computing 18(21), 1–32. URL https://theoryofcomputing.org/articles/v018a021.
Gil Cohen, Dean Doron, Ori Sberlo & Amnon Ta-Shma (2023). Approximating Iterated Multiplication of Stochastic Matrices in Small Space. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, 35–45. ACM.
James Cook, Jiatu Li, Ian Mertz & Edward Pyne (2024). The Structure of Catalytic Space: Capturing Randomness and Time via Compression. Electron. Colloquium Comput. Complex. TR24-106.
James Cook & Ian Mertz (2020). Catalytic approaches to the tree evaluation problem. In Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, 752–760. ACM.
James Cook & Ian Mertz (2024). Tree Evaluation Is in Space O(log n · log log n). In Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, June 24-28, 2024, Bojan Mohar, Igor Shinkar & Ryan O’Donnell, editors, 1268–1278. ACM.
Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma & Raghunath Tewari (2020). Randomized and Symmetric Catalytic Computation. In Computer Science - Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, 211– 223. Springer.
Dean Doron, Edward Pyne & Roei Tell (2024). Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, June 24-28, 2024, Bojan Mohar, Igor Shinkar & Ryan O’Donnell, editors, 2039–2049. ACM. URL https://doi.org/10.1145/3618260.3649772.
Chetan Gupta, Rahul Jain, Vimal Raj Sharma & Raghunath Tewari (2019). Unambiguous Catalytic Computation. In 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019, volume 150 of LIPIcs, 16:1– 16:13.
Daniel M. Kane, Raghu Meka & Jelani Nelson (2011). Almost Optimal Explicit Johnson-Lindenstrauss Families. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings, Leslie Ann Goldberg, Klaus Jansen, R. Ravi & JosÉ D. P. Rolim, editors, volume 6845 of Lecture Notes in Computer Science, 628–639. Springer. URL https://doi.org/10.1007/978-3-642-22935-0_53.
Daniel M. Kane & Jelani Nelson (2014). Sparser Johnson- Lindenstrauss Transforms. J. ACM 61(1), 4:1–4:23.
Jiatu Li, Edward Pyne & Roei Tell (2024). Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness. In 65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024, Chicago, IL, USA, October 27-30, 2024, 1–13. IEEE.
Ian Mertz (2023). Reusing Space: Techniques and Open Problems. Bulletin of EATCS 141(3).
Noam Nisan (1990). Psuedorandom Generators for Space-Bounded Computation. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, USA, Harriet Ortiz, editor, 204–212. ACM. URL https://doi.org/10.1145/100216.100242.
Noam Nisan (1993). On Read-Once vs. Multiple Access to Randomness in Logspace. Theor. Comput. Sci. 107(1), 135–144. URL https://doi.org/10.1016/0304-3975(93)90258-U.
Noam Nisan (1994). RL ¡= SC. Comput. Complex. 4, 1–11. URL https://doi.org/10.1007/BF01205052.
Aaron (Louie) Putterman & Edward Pyne (2023). Near-Optimal Derandomization of Medium-Width Branching Programs. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, 23–34.
Edward Pyne, Ran Raz & Wei Zhan (2023). Certified Hardness vs. Randomness for Log-Space. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, 989–1007. IEEE. URL https://doi.org/10.1109/FOCS57990.2023.00061.
Michael E. Saks & Shiyu Zhou (1999).\(BP_HSpace(S) \subseteq DSPACE(S^{3/2})\). J. Comput. Syst. Sci. 58(2), 376–403. URL https://doi.org/10.1006/jcss.1998.1616.
D. Sivakumar (2002). Algorithmic derandomization via complexity theory. In Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, John H. Reif, editor, 619–626. ACM. URL https://doi.org/10.1145/509907.509996.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Pyne, E. Derandomizing Logspace With a Small Shared Hard Drive. comput. complex. 34, 13 (2025). https://doi.org/10.1007/s00037-025-00275-6
Received:
Published:
DOI: https://doi.org/10.1007/s00037-025-00275-6