On limited nondeterminism and the complexity of the V-C dimension

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI:10.1109/SCT.1993.336545

C. Papadimitriou, M. Yannakakis

引用次数: 223

Abstract

The complexity of several natural computational problems in NP, which have been proposed but not categorized satisfactorily in the literature is characterized precisely. These problems can be solved in n/sup O(logn)/ time, and thus they are probably not NP-complete. Two new complexity classes between P and NP, very much in the spirit of MAXNP and MAXSNP, are defined. It is shown that computing the V-C dimension is complete for the more general class, whereas the other two problems are complete for the weaker class.<>

查看原文本刊更多论文

有限不确定性与V-C维的复杂性

本文对NP中几个已被提出但在文献中分类不满意的自然计算问题的复杂性进行了精确表征。这些问题可以在n/sup O(logn)/时间内解决，因此它们可能不是np完全的。在P和NP之间定义了两个新的复杂度类，非常符合MAXNP和MAXSNP的精神。结果表明，对于较一般的类，计算V-C维数是完备的，而对于较弱的类，另外两个问题是完备的

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

求助全文

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

来源期刊

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference

自引率

0.00%

发文量