Polynominal time reducibility

Proceedings of the fifth annual ACM symposium on Theory of computing Pub Date : 1973-04-30 DOI:10.1145/800125.804042

R. Ladner

引用次数: 11

Abstract

Several of the results that appear in [4] are stated to be true of polynominal time reducibility (≤p) but are not proved explicitly. We shall prove several of these results with the hope of shedding some light on the “determinism vs. nondeterminism” problem. The ideas behind these proofs already exist in [4] but appear here in a different setting. We shall spend most of our time on two theorems: (i) If φ

查看原文本刊更多论文

多标称时间可约性

[4]中出现的几个结果被认为是多名义时间可约性(≤p)的结果，但没有得到明确的证明。我们将证明其中的几个结果，希望能对“决定论与非决定论”问题有所启发。这些证明背后的思想已经存在于b[4]中，但在这里出现在不同的设置中。我们将把大部分时间花在两个定理上:(i)如果φ

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

求助全文

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

来源期刊