论文信息 - A Note on Linear-Nondeterminism, Linear-Sized, Karp-Lipton Advice for the P-Selective Sets

A Note on Linear-Nondeterminism, Linear-Sized, Karp-Lipton Advice for the P-Selective Sets

Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and quasilinear nondeterminism. We show that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and linear nondeterminism.

[1] Kathryn Fraughnaugh,et al. Introduction to graph theory , 1973, Mathematical Gazette.

[2] H. Landau. On dominance relations and the structure of animal societies: III The condition for a score structure , 1953 .

[3] Richard J. Lipton,et al. Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[4] Mitsunori Ogihara,et al. P-selective sets, and reducing search to decision vs. self-reducibility , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[5] Lane A. Hemaspaandra,et al. Computing Solutions Uniquely Collapses the Polynomial Hierarchy , 1994, SIAM J. Comput..

[6] Alan L. Selman,et al. P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP , 1979, ICALP.

[7] Lane A. Hemaspaandra,et al. Optimal Advice , 1996, Theor. Comput. Sci..

[8] Arfst Nickelsen. Deciding Verbose Languages with Linear Advice , 1997, MFCS.