Ⅰ. 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 res...Ⅰ. 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:展开更多
文摘Ⅰ. 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:
