Traversal-invariant characterizations of logarithmic space

06/12/2020
by   Siddharth Bhaskar, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset