关于因果排序问题复杂性的一个注记
A note on the complexity of the causal ordering problem
摘要:
在本说明中,我们提供了一个简洁的报告的因果排序问题的复杂性,最初介绍了西蒙的原因隐含在系统的数学方程的因果依赖关系。我们表明,西蒙的经典算法来推断因果顺序是NP-困难--一个棘手的猜测,但从来没有证明。然后,我们提出了一个详细的帐户Nayak的建议的算法解决方案(最好的),这是由计算传递封闭-有界的时间由$O(|\mathcal V|\cdot |\mathcal S|)$,其中$\mathcal S(\mathcal E, \mathcal V)$是输入系统结构组成的一组$\mathcal E$方程组在一组$\mathcal V$变量与变量的外观(密度)$|\mathcal S|$。我们还评论了因果排序在大规模假设管理和分析中的新兴应用的潜力。
英文摘要:
In this note we provide a concise report on the complexity of the causal ordering problem, originally introduced by Simon to reason about causal dependencies implicit in systems of mathematical equations. We show that Simon's classical algorithm to infer causal ordering is NP-Hard---an intractability previously guessed but never proven. We present then a detailed account based on Nayak's suggested algorithmic solution (the best available), which is dominated by computing transitive closure---bounded in time by $O(|\mathcal V|\cdot |\mathcal S|)$, where $\mathcal S(\mathcal E, \mathcal V)$ is the input system structure composed of a set $\mathcal E$ of equations over a set $\mathcal V$ of variables with number of variable appearances (density) $|\mathcal S|$. We also comment on the potential of causal ordering for emerging applications in large-scale hypothesis management and analytics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。