The power of local self-reductions

Identify a string x over.

[1]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[2]  Mitsunori Ogihara.  On Serializable Languages , 1994, Int. J. Found. Comput. Sci..

[3]  José L. Balcázar.  Self-Reducibility , 1990, J. Comput. Syst. Sci..

[4]  Mitsunori Ogihara,et al.  On one query, self-reducible sets , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[5]  Neil Immerman,et al.  On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[6]  Lane A. Hemaspaandra,et al.  On Sets with Efficient Implicit Membership Tests , 1991, SIAM J. Comput..

[7]  David A. Mix Barrington,et al.  Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.

[8]  Lane A. Hemaspaandra,et al.  Near-Testable Sets , 1991, SIAM J. Comput..

[9]  Allan Borodin,et al.  On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..

[10]  Jin-Yi Cai,et al.  PSPACE survives three-bit bottlenecks , 1987, Computational Complexity Conference.

[11]  Thomas Schwentick,et al.  On the power of polynomial time bit-reductions , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[12]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.