Traversal-invariant characterizations of logarithmic space

06/12/2020

∙

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

Traversal-invariant characterizations of logarithmic space

Invariant Integration in Deep Convolutional Feature Space

On genuine invariance learning without weight-tying

Distributionally Invariant Learning: Rationalization and Practical Algorithms

Illumination-invariant image mosaic calculation based on logarithmic search

The Stochastic complexity of spin models: How simple are simple spin models?

On forward invariance in Lyapunov stability theorem for local stability

Accelerating Natural Gradient with Higher-Order Invariance

Traversal-invariant characterizations of logarithmic space

Related Research

Invariant Integration in Deep Convolutional Feature Space

On genuine invariance learning without weight-tying

Distributionally Invariant Learning: Rationalization and Practical Algorithms

Illumination-invariant image mosaic calculation based on logarithmic search

The Stochastic complexity of spin models: How simple are simple spin models?

On forward invariance in Lyapunov stability theorem for local stability

Accelerating Natural Gradient with Higher-Order Invariance