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.

翻译：我们证明，在强指数时间假设成立的前提下，判定模拟等价与模拟预序具有二次下界。这与已知的模拟等价最佳二次上界相一致。这意味着判定模拟问题本质上是二次的。该结果的一个典型推论是：计算模拟等价从根本上比计算互模拟更为困难。