摘要
本文提出Ｆｅｗ算子并研究其决定的复杂性类，得到了复杂性类ＰｔｔＣ的新刻划．利用此刻划讨论了多项式时间概率复杂性类ＰＰ的能力．
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.
出处
《计算机学报》
EI
CSCD
北大核心
1996年第9期658-660,共3页
Chinese Journal of Computers
基金
国家863计划
关键词
Few算子
多项式
时间概率
算法
Computational complexity, Few operator, P_tt￣C, probabilistic polynomial time algorithm
