On the Quantifier-Free Dynamic Complexity of Reachability
type: Item
instance of: scholarly article
title: On the Quantifier-Free Dynamic Complexity of Reachability
zbMATH Open document ID: 1371.68063
DOI: 10.1007/978-3-642-40313-2_73
author: Thomas Zeume
author: Thomas Schwentick
published in: Mathematical Foundations of Computer Science 2013
publication date: 2013-09-20T00:00:00Z
full work available at URL: https://arxiv.org/abs/1306.3056
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 6210025
MaRDI profile type: Publication
OpenAlex ID: W2570673476
arXiv ID: 1306.3056
Recommended article: On the quantifier-free dynamic complexity of reachability
Recommended article: Dynamic Complexity of Directed Reachability and Other Problems
Recommended article: Dynamic Complexity of the Dyck Reachability
Recommended article: On the Complexity of L-reachability
Recommended article: On the Complexity of L-reachability*
Recommended article: Q3203003
Recommended article: Complexity of reachability problems for finite discrete dynamical systems
Recommended article: The Cost of Exactness in Quantitative Reachability
Recommended article: On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction
description: scientific article