Almost-catalytic computation

DOI10.1007/978-3-031-92935-9_3MaRDI QIDQ6902128zbMATH OpenFDO

Authors Sagar Bisoyi, Krishnamoothy Dinesh, Bhabya Deep Rai, Jayalal Sarma M. N.

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92935-9_3

zbMATH Keywords

catalytic computationcodes and catalytic computationspace complexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Analysis of Boolean Functions
• Catalytic computation
• Catalytic space: non-determinism and hierarchy
• Computational Complexity
• Computational Complexity
• Computing with a full memory: catalytic space
• Covering radius---Survey and recent results
• Derandomizing logspace with a small shared hard drive
• Hardness Amplification Via Space-Efficient Direct Products
• scientific article; zbMATH DE number 7650313 (Why is no real title available?)
• Pebbles and branching programs for tree evaluation
• Randomized and Symmetric Catalytic Computation
• Reusing space: techniques and open problems
• The complexity of error-correcting codes
• Upper bounds on Fourier entropy

This page was built for publication: Almost-catalytic computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902128)