论文标题
对数空间的遍历不变的特征
Traversal-invariant characterizations of logarithmic space
论文作者
论文摘要
我们使用遍历不变性对L和NL可计算查询的L和NL可计算查询进行了新颖的描述性复合性表征。我们总结为（n）l = fo +（广度优先）的遍历不变性。
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.
