Tag
space-complexity
- May 11, 2026 Space Complexity Accounting for Recursion, Auxiliary Buffers and Output Stack depth, explicit work arrays and output storage are three separate memory costs, and the convention for counting them decides whether an algorithm is called O(1) space, O(log n) or O(n). algorithms
- Nov 18, 2024 Configuration Graphs and Savitch's Reachability Argument How a nondeterministic space-bounded computation becomes a path problem in a configuration graph, and why reachability composes into a quadratic blowup in space rather than an exponential one. computation theory