Note on the P =?NP Problem Relativized
Received:March 11, 1991  
Key Words:   
Fund Project:
Author NameAffiliation
Song Enmin Dept. of Computer
Huazhong Univ. of Scie. and Tech.
Wuhan 
Jin Renchao Dept. of Computer
Huazhong Univ. of Scie. and Tech.
Wuhan 
Huang Wenqi Dept. of Computer
Huazhong Univ. of Scie. and Tech.
Wuhan 
Hits: 2153
Download times: 1289
Abstract:
      The P =?NP problem relativized can have two opposite results with the difference of oracle sets. In this paper, we get the results as follows:1. There exists an infinite series of sets S1,S2,…, whose complexity is strictly in-creasing, and if they become oracles, they can make the P =?NP and P ≠NP relativized alternately.2. There exists recursive oracle A out of NP such that P = NP equals PA= NPA.
Citation:
DOI:10.3770/j.issn:1000-341X.1993.03.023
View Full Text  View/Add Comment