arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1309.0296cs.CC
收藏

一种新的复杂性

A new kind of complexity

Rade Vuckovac

摘要:

提出了一类新的函数。算法的结构,特别是选择标准(分支),用于定义新类的基本属性。新函数最有趣的特性是实例很容易计算,但如果函数的输入是模糊的,函数的描述是指数复杂的。这一属性为随机性,特别是随机预言机模型提供了新的视角,并给出了几个随机预言机实现的实际例子。因此,在一般的计算复杂性上有一个新的有趣的观点。

英文摘要:

A new class of functions is presented. The structure of the algorithm, particularly the selection criteria (branching), is used to define the fundamental property of the new class. The most interesting property of the new functions is that instances are easy to compute but if input to the function is vague the description of a function is exponentially complex. This property puts a new light on randomness especially on the random oracle model with a couple of practical examples of random oracle implementation. Consequently, there is a new interesting viewpoint on computational complexity in general.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑