Optimizing TRIEs for ordered pattern matching is /spl Pi//sub 2//sup P/-complete

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI:10.1109/SCT.1995.514862

Chih-Long Lin

引用次数: 4

Abstract

We consider the complexity of constructing a data structure, called TRIEs, with the minimum operational cost for the ordered pattern matching problem, a problem abstracting the essence of executing Prolog problems; a TRIE with minimal cost corresponds to a program with the minimum worst case operational cost. Based on the recent non-approximability results developed by Arora et al. (1992) and Condon et al. (1993), we show that to approximate the optimum cost of this problem to within some constant ratio is /spl Pi//sub 2//sup P/-hard. The result implies that the problem of Prolog program optimization is probably as hard.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

对有序模式匹配的优化try是/spl Pi// sub2 //sup P/-complete

我们考虑了构建一个称为try的数据结构的复杂性，以最小的操作成本来解决有序模式匹配问题，这个问题抽象了执行Prolog问题的本质;具有最小成本的TRIE对应于具有最小最坏情况运行成本的程序。基于Arora et al.(1992)和Condon et al.(1993)最近提出的非近似性结果，我们表明，要将该问题的最佳成本近似为/spl Pi//sub 2//sup P/-hard。结果表明，Prolog程序优化问题可能同样困难。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference

自引率

0.00%

发文量

期刊最新文献

On superlinear lower bounds in complexity theory The isomorphism conjecture holds and one-way functions exist relative to an oracle An excursion to the Kolmogorov random strings Optimizing TRIEs for ordered pattern matching is /spl Pi//sub 2//sup P/-complete Resource-bounded genericity