BibTeX
CSL-JSON
MLA
Harvard
The Complexity of Bisimulation and Simulation on Finite Systems
release_3qmsuonnurb2jpystyfioqtlli
by
Moses Ganardi, Stefan Göller, Markus Lohrey
Released
as a article
.
2018
Abstract
In this paper the computational complexity of the (bi)simulation problem over
restricted graph classes is studied. For trees given as pointer structures or
terms the (bi)simulation problem is complete for logarithmic space or NC^1,
respectively. This solves an open problem from Balcázar, Gabarró, and
Sántha. Furthermore, if only one of the input graphs is required to be a
tree, the bisimulation (simulation) problem is contained in AC^1 (LogCFL). In
contrast, it is also shown that the simulation problem is P-complete already
for graphs of bounded path-width.
In text/plain
format
Archived Files and Locations
application/pdf 384.2 kB
file_nnld36hvt5cxtiufwmjbvpty4a
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1806.00256v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links