Trading Determinism for Time: The k-Reach Problem

2024-09-27

AI Summary

This work investigates the deterministic–time trade-off in space-bounded computation, focusing on the reachability problem on directed path graphs with at most $k$ path switches. We introduce a combinatorial graph-theoretic modeling framework and a hierarchical path encoding technique. Our main contribution is the first explicit space–time trade-off for this problem that circumvents the Savitch paradigm: deterministic algorithms solve it in $O(k log f + log n)$ space but require superpolynomial time; in contrast, unambiguous nondeterministic algorithms achieve polynomial-time solvability within the same space bound. This result exposes a fundamental separation between deterministic and unambiguous nondeterministic computation for $k$-switch path reachability, advances our understanding of space-complexity boundaries, and establishes a novel algorithmic paradigm for computation under stringent space constraints.

Technology Category

• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Search and Optimization: Combinatorial Optimization
• Planning, Routing, and Scheduling: Deterministic Planning

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Semantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semantics
• Responsible Web: Human-perceived consequences of algorithmic deployment on the web

Abstract

Kallampally and Tewari showed in 2016 that there can be a trade-off between determinism and time in space-bounded computations. This they did by describing an unambiguous non-deterministic algorithm to solve Directed Graph Reachability that requires O(log^2 n) space and simultaneously runs in polynomial time. Savitch's 1970 algorithm that solves the same problem deterministically also requires O(log^2 n) space but doesn't guarantee polynomial running time and hence the trade off. We describe a new problem for which we can show a similar trade off between determinism and time. We consider a collection P of f directed paths. We show that the problem of finding reachability from one vertex to another in the union G of these path graphs via a path that switches amongst the paths in P at most k times can be solved in O(klog f+log n) space but the algorithm doesn't guarantee polynomial runtime. On the other hand, we also show that the same problem can be solved by an unambiguous non-deterministic algorithm that simultaneously runs in O(klog f+log n) space and polynomial time. Since these two algorithms are not dependent on Savitch, therefore this example sheds new light on how such a trade off between determinism and time happens in space-bounded computations and makes the phenomenon less elusive.

Problem

• Trade-off between determinism and time in space-bounded computations
• Solve k-reach problem with space efficiency but non-polynomial time
• Unambiguous non-deterministic algorithm achieves both space efficiency and polynomial time

Innovation

• Unambiguous non-deterministic algorithm for reachability
• O(klog f+log n) space with polynomial time
• Trade-off between determinism and time demonstrated