Self-reducibility

作者:

Highlights:

摘要

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.

论文关键词:

论文评审过程:Received 1 October 1988, Revised 17 July 1989, Available online 2 December 2003.

论文官网地址:https://doi.org/10.1016/0022-0000(90)90025-G