Showing cs.CCShow all
2 papers · 1 filter
cs.CC2025
Improved Bounds on the Space Complexity of Circuit Evaluation
Yakov Shalunov
Williams (STOC 2025) recently proved that time- multitape Turing machines can be simulated using space using the Cook-Mertz (STOC 2024) tree evaluation proc…
cs.CC2023
Leakage-Resilient Hardness Equivalence to Logspace Derandomization
Yakov Shalunov
Efficient derandomization has long been a goal in complexity theory, and a major recent result by Yanyi Liu and Rafael Pass identifies a new class of hardness assumption under whic…