On the power of probabilistic polynomial time and few operator Few算子和多项式时间概率算法PP的能力
This paper presents the Few operator, which can be used to characterize the class PC. Using this new characterization, the power of probabilistic polynomial time is studied. 本文提出Few算子并研究其决定的复杂性类,得到了复杂性类PttC的新刻划.利用此刻划讨论了多项式时间概率复杂性类PP的能力。
In this paper, we present a new match protocol. It is of semantic security : there exists no probabilistic polynomial time algorithm to distinguish two guessed inputs. 本文给出了一个新的匹配协议,该协议是语义安全的,不存在概率多项式时间(PPT)算法区分对两个输入的猜测值。
Some Results On Probabilistic Polynomial & time Hierarchy 关于概率多项式时间(PPT)谱系的一些结果