On Characterizations of the Class PSPACE/POLY

Abstract We present several characterizations of the class PSPACE /poly. These characterizations are given in terms of PSPACE -complete problems, certain algebraic closure operations, vectorial straight-line programs, and Kolmogorov complexity. To end, we characterize the problems having an exponential lower bound on their nonuniform complexity measured by vectorial straight-line programs.

[1]  John E. Savage,et al.  The Complexity of Computing , 1976 .

[2]  Jia-Wei Hong.  On Similarity and Duality of Computation (I) , 1984, Inf. Control..

[3]  Stephen A. Cook,et al.  Hardware complexity and parallel computation , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[4]  W. P. Petersen,et al.  Vector Fortran for numerical problems on CRAY-1 , 1983, CACM.

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

[6]  Leslie M. Goldschlager,et al.  A universal interconnection pattern for parallel computers , 1982, JACM.

[7]  Ronald V. Book.  Simple Representations of Certain Classes of Languages , 1978, JACM.

[8]  Uwe Schöning.  On Small Generators , 1984, Theor. Comput. Sci..

[9]  Ronald V. Book.  Polynomial Space and Transitive Closure , 1979, SIAM J. Comput..

[10]  Larry J. Stockmeyer,et al.  A Characterization of the Power of Vector Machines , 1976, J. Comput. Syst. Sci..

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

[12]  Ker-I Ko,et al.  On the Notion of Infinite Pseudorandom Sequences , 1986, Theor. Comput. Sci..

[13]  Richard M. Russell,et al.  The CRAY-1 computer system , 1978, CACM.