Search Results

Documents authored by Weinstein, Scott


Document
Traversal-Invariant Characterizations of Logarithmic Space

Authors: Siddharth Bhaskar, Steven Lindell, and Scott Weinstein

Published in: OASIcs, Volume 119, The Provenance of Elegance in Computation - Essays Dedicated to Val Tannen (2024)


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 as

Siddharth Bhaskar, Steven Lindell, and Scott Weinstein. Traversal-Invariant Characterizations of Logarithmic Space. In The Provenance of Elegance in Computation - Essays Dedicated to Val Tannen. Open Access Series in Informatics (OASIcs), Volume 119, pp. 2:1-2:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)


Copy BibTex To Clipboard

@InProceedings{bhaskar_et_al:OASIcs.Tannen.2,
  author =	{Bhaskar, Siddharth and Lindell, Steven and Weinstein, Scott},
  title =	{{Traversal-Invariant Characterizations of Logarithmic Space}},
  booktitle =	{The Provenance of Elegance in Computation - Essays Dedicated to Val Tannen},
  pages =	{2:1--2:17},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-320-1},
  ISSN =	{2190-6807},
  year =	{2024},
  volume =	{119},
  editor =	{Amarilli, Antoine and Deutsch, Alin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Tannen.2},
  URN =		{urn:nbn:de:0030-drops-200984},
  doi =		{10.4230/OASIcs.Tannen.2},
  annote =	{Keywords: Model theory, finite model theory, descriptive complexity theory, logarithmic space, graph traversals}
}