Traversal-invariant characterizations of logarithmic space [article]

Siddharth Bhaskar, Steven Lindell, Scott Weinstein
2020 arXiv   pre-print
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.
arXiv:2006.07067v1 fatcat:eroaqig6qrf2tdoyut5xdfqeke