What is Structural Complexity Theory

[1]  Tang Shouwen,et al.  Randomness, Tally Sets, and Complexity Classes , 1989 .

[2]  Ding-Zhu Du,et al.  On polynomial and generalized complexity cores , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[3]  Uwe Schöning,et al.  Complexity and Structure , 1986, Lecture Notes in Computer Science.

[4]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[5]  Ming Li,et al.  Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87 , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[6]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Ding-Zhu Du,et al.  On One-Way Functions and Polynomial-Time Isomorphisms , 1986, Theor. Comput. Sci..

[9]  José L. Balcázar,et al.  Structural Complexity II , 2012, EATCS.

[10]  Juris Hartmanis,et al.  An Overview of the Theory of Computational Complexity , 1971, JACM.

[11]  渡邉 治.  On the structure of intractable complexity classes , 1987 .

[12]  Osamu Watanabe,et al.  A Comparison of Polynomial Time Completeness Notions , 1987, Theor. Comput. Sci..

[13]  Ker-I Ko,et al.  Constructing Oracles by Lower Bound Techniques for Circuits , 1989 .

[14]  Ronald V. Book.  Sparse Sets, Tally Sets, and Polynomial Reducibilities , 1988, MFCS.

[15]  Osamu Watanabe.  On One-Way Functions , 1989 .

[16]  Alan L. Selman,et al.  Complexity Measures for Public-Key Cryptosystems , 1988, SIAM J. Comput..