THE POLYNOMIAL-TIME HIERARCHY AND ORACLE SET A∈PH/poly  

作　　者：李宏宙 

机构地区：[1]Department of Mathematics, Yunnan Education College, Yunnan 650031, PRC

出　　处：《Chinese Science Bulletin》1991年第1期17-20,共4页

摘　　要：Ⅰ. INTRODUCTIONA central problem in computational complexity is whether or not the polynomial-time hierarchy is proper. Balcázar, Book and Schning have studied this problem by considering relativization with respect to sparse sets and proved the following results:

关 键 词：POLYNOMIAL-TIME HIERARCHY RELATIVIZATION PH PH/poly. 

分 类 号：N[自然科学总论]