2 papers
cs.DS2025
Universal Hirschberg for Width Bounded Dynamic Programs
Logan Nye
Hirschberg's algorithm (1975) reduces the space complexity for the longest common subsequence problem from to via recursive midpoint bisection on a grid dynamic pro…
cs.CC2025
On the Holographic Geometry of Deterministic Computation
Logan Nye
Standard simulations of Turing machines suggest a linear relationship between the temporal duration of a run and the amount of information that must be stored by known simulati…