Reachability and the power of local ordering
type: Item
instance of: scholarly article
title: Reachability and the power of local ordering
zbMATH Open document ID: 0884.68053
DOI: 10.1016/0304-3975(95)00034-T
author: Kousha Etessami
author: Neil Immerman
published in: Theoretical Computer Science
publication date: 1997-09-29T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1065144
zbMATH Keywords: transitive closure operator
zbMATH Keywords: jumping automaton on graphs
MaRDI profile type: Publication
cites work: Reachability is harder for directed than for undirected finite graphs
cites work: Q4034699
cites work: An optimal lower bound on the number of variables for graph identification
cites work: Space Lower Bounds for Maze Threadability on Restricted Machines
cites work: Q4942645
cites work: Tree canonization and transitive closure
cites work: Q3666827
cites work: Upper and lower bounds for first order expressibility
cites work: Languages that Capture Complexity Classes
cites work: Nondeterministic Space is Closed under Complementation
cites work: Q3830533
cites work: Expressibility and Parallel Complexity
description: scientific article; zbMATH DE number 1065144