9 citations · 15 across the 6 of their papers we have counts for
1 paper · 1 filter
Siddharth Bhaskar, Steven Lindell, Scott Weinstein
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 +…