Traversal-invariant characterizations of logarithmic space
Logic in Computer Science
2020-06-15 v1 Logic
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.
Cite
@article{arxiv.2006.07067,
title = {Traversal-invariant characterizations of logarithmic space},
author = {Siddharth Bhaskar and Steven Lindell and Scott Weinstein},
journal= {arXiv preprint arXiv:2006.07067},
year = {2020}
}