论文信息 - Self-Reducibility

Self-Reducibility

New self-reducibility structures are proposed to deal with sets outside the class PSPACE and with sets in logarithmic space complexity classes. General properties derived from the definition are used to prove known results comparing uniform and nonuniform complexity classes and to obtain new ones regarding deterministic time classes, nondeterministic space classes, and reducibility to context-free languages.

José L. Balcázar

[1] Ivan Hal Sudborough,et al. On the Tape Complexity of Deterministic Context-Free Languages , 1978, JACM.

[2] Neil Immerman. Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[3] R. Ladner. The circuit value problem is log space complete for P , 1975, SIGA.

[4] Stephen R. Mahaney. Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..

[5] Alfred V. Aho,et al. Time and Tape Complexity of Pushdown Automaton Languages , 1968, Inf. Control..

[6] Sheila A. Greibach,et al. The Hardest Context-Free Language , 1973, SIAM J. Comput..

[7] Allan Borodin,et al. Two applications of complementation via inductive counting , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[8] Ker-I Ko. On Self-Reducibility and Weak P-Selectivity , 1983, J. Comput. Syst. Sci..

[9] Janos Simon,et al. Space-Bounded Hierarchies and Probabilistic Computations , 1984, J. Comput. Syst. Sci..

[10] Steven Fortune,et al. A Note on Sparse Complete Sets , 1978, SIAM J. Comput..

[11] Stephen A. Cook,et al. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[12] José L. Balcázar,et al. The polynomial-time hierarchy and sparse oracles , 1986, JACM.

[13] Piotr Berman. Relationship Between Density and Deterministic Complexity of NP-Complete Languages , 1978, ICALP.