论文信息 - Refining the polynomial hierarchy

Refining the polynomial hierarchy

By a result of Kadin, the difference hierarchy over NP does not collapse if the polynomial hierarchy does not. We extend this result to a natural refinement of the polynomial hierarchy. The refinement is obtained from levels of the polynomial hierarchy by validly applying addition modulo 2, and so here we call it the plus-hierarchy. Also, we consider two refinements of the plus-hierarchy, which may be relevant to a classification of some languages.

V. L. Selivanov

[1] Klaus W. Wagner,et al. The Difference and Truth-Table Hierarchies for NP , 1987, RAIRO Theor. Informatics Appl..

[2] Victor Selivanov,et al. Fine Hierarchy of Regular Omega-Languages , 1995, Theor. Comput. Sci..

[3] Gerd Wechsung,et al. On the Boolean closure of NP , 1985, FCT.

[4] Victor L. Selivanov,et al. Fine hierarchies and Boolean terms , 1995, Journal of Symbolic Logic.

[5] Jim Kadin. The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses , 1988, SIAM J. Comput..

[6] Chee-Keng Yap,et al. Some Consequences of Non-Uniform Conditions on Uniform Classes , 1983, Theor. Comput. Sci..

[7] Victor L. Selivanov. Two Refinements of the Polynomial Hierarcht , 1994, STACS.

[8] V. L. Selivanov. Hierearchies of hyperarithmetical sets and functions , 1983 .

[9] Richard Chang,et al. On the Structure of NP Computations under Boolean Operators , 1991 .