Traversal-invariant characterizations of logarithmic space
Siddharth Bhaskar, Steven Lindell, Scott Weinstein
TL;DR
This paper introduces a new way to characterize the complexity classes L and NL using traversal invariance in descriptive complexity, linking logical definability with computational complexity.
Contribution
It provides a novel descriptive complexity characterization of L and NL based on traversal invariance, connecting logical definability with computational complexity classes.
Findings
L and NL can be characterized by FO logic with traversal invariance.
Traversal invariance captures the essence of logarithmic space computations.
The approach offers a new perspective on descriptive complexity theory.
Abstract
We give a novel descriptive-complexity theoretic characterization of L and NL computable queries over finite structures using traversal invariance. We summarize this as (N)L = FO + (breadth-first) traversal-invariance.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.