1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.CC2020★ 1 cited
Cons-free Programs and Complexity Classes between LOGSPACE and PTIME
Neil D. Jones, Siddharth Bhaskar, Cynthia Kop +1
Programming language concepts are used to give some new perspectives on a long-standing open problem: is logspace = ptime ?
cs.LO2020
Traversal-invariant characterizations of logarithmic space
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 +…
math.LO2018
Algorithmic Traversals of Infinite Graphs
Siddharth Bhaskar, Anton Jay Kienzle
A traversal of a connected graph is a linear ordering of its vertices all of whose initial segments induce connected subgraphs. Traversals, and their refinements such as breadth-fi…