加载中…
2002-07-17
Knuth-Bendix constraint solving is NP-complete
Konstantin KorovinAndrei Voronkov
文献摘要
We show the NP-completeness of the existential theory of term algebras with the Knuth-Bendix order by giving a nondeterministic polynomial-time algorithm for solving Knuth-Bendix ordering constraints.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本