A Quadratic Lower Bound for Simulation
Logic in Computer Science
2024-11-22 v1
Abstract
We show that deciding simulation equivalence and simulation preorder have quadratic lower bounds assuming that the Strong Exponential Time Hypothesis holds. This is in line with the best know quadratic upper bounds of simulation equivalence. This means that deciding simulation is inherently quadratic. A typical consequence of this result is that computing simulation equivalence is fundamentally harder than bisimilarity.
Cite
@article{arxiv.2411.14067,
title = {A Quadratic Lower Bound for Simulation},
author = {Jan Friso Groote and Jan Martens},
journal= {arXiv preprint arXiv:2411.14067},
year = {2024}
}