Hong-Zhou Li

Government of the People's Republic of China, Peping, Beijing, China

Are you Hong-Zhou Li?

Claim your profile

Publications (6)0.49 Total impact

  • Bin Fu, Hong-Zhou Li
    [Show abstract] [Hide abstract]
    ABSTRACT: A language A is said to be P-close if there exists a B in P such that the symmetric difference of A and B forms a sparse set. (A set is sparse if it contains only polynomially many elements up to length n). In this paper the notion of P-closeness is further generalized to arbitrary classes C. Several results of the following general pattern are shown: No NP-hard set can be C-close unless NP = C.
    SIAM J. Comput. 01/1994; 23:255-260.
  • Bin Fu, Hong-Zhou Li, Yong Zhong
    [Show abstract] [Hide abstract]
    ABSTRACT: We separateNE from $P_{n^{o(1)} - T} (NP)$ by using the translational method.
    Mathematical Systems Theory 01/1994; 27:183-186.
  • Bin Fu, Hong-Zhou Li
    [Show abstract] [Hide abstract]
    ABSTRACT: The possibility and consequences are studied of having an NP-hard set that forms a symmetric difference with an “easy” set (like a weakly p-selective set) that is of “low information content”. Especially, it is shown that the existence of an NP-hard set A (with respect to many- one reducibility) that forms a symmetric difference to a weakly p- selective set B, such that both A-B and B-A are bounded-truth-table reducible to a sparse set implies P=NP. The proof is based on the tree pruning techniques by Mahaney and Fortune.
    Theoretical Computer Science 11/1993; 120:279-291. · 0.49 Impact Factor
  • Fin Fu, Hong-zhou Li
    [Show abstract] [Hide abstract]
    ABSTRACT: The difference between NP and other complexity classes is examined. The question of whether an NP-hard set can be approximated sufficiently by the sets in other complexity classes is studied
    Structure in Complexity Theory Conference, 1992., Proceedings of the Seventh Annual; 07/1992
  • Bin Fu, Hong-zhou Li, Yong Zhong
    [Show abstract] [Hide abstract]
    ABSTRACT: The authors separate NE from P<sub>x</sub> (NP), where x = n <sup>0(1)</sup>- T . The class EXP-low[1] is introduced and applied in the investigations of stable properties for both EXP and NEXP hard sets. A set A is in EXP-low[1](EXP-low resp.) if EXP <sup>A[1]</sup>=EXP(EXP<sup>A</sup>=EXP). The authors separate EXP-low[1] from EXP-low by constructing a set A such that EXP <sup>A[1]</sup>=EXP and EXP<sup>A</sup>=EXP<sup>EXP</sup>
    Structure in Complexity Theory Conference, 1992., Proceedings of the Seventh Annual; 07/1992
  • Bin Fu, Hong-Zhou Li
    Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings; 01/1992

Publication Stats

18 Citations
0.49 Total Impact Points

Institutions

  • 1994
    • Government of the People's Republic of China
      Peping, Beijing, China