Abstract
The class of sets decided within polynomial space by machines with polynomial advice, PSPACE/poly, is characterized in several ways. Some PSPACE-complete sets furnish a characterization. Query length in oracle machines, closure of a small class under algebraic operations, parallel straight-line programs, and Kolmogorov complexity are other approaches that allow to characterize the class PSPACE/poly. Some properties of a dual class defined by exponential lower bounds are also shown, as a version of Lupanov theorem and a characterization in terms of oracle Turing machines.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.L. Balcázar, J. Gabarró: Connections among non-uniform models for problems requiring a high amount of resources. Preprint, 1985.
R. Book: Simple characterizations of certain classes of languages. Journal ACM 25 (1978), 23–31.
R. Book: Polynomial space and transitive closure. SIAM J. Computing 8 (1979), 434–439.
R. Book: On languages accepted by space-bounded oracle machines. Acta Informatica 12 (1979), 177–185.
P. Dymond, S. Cook: Hardware complexity and parallel computation. 21th IEEE Symp. on Found. of Comp. Sci. (1980), 360–371.
L. Goldschlager: A unified approach to models of synchronous parallel machines. 10th ACM Symp. on Theory of Comp. (1978), 89–94.
G. Goodrich, R. Ladner, M, Fischer: Straight-line programs to compute finite languages. Conf. Theor. Comp. Sci., Waterloo 1977.
J. Hartmanis: Generalized Kolmogorov complexity and the structure of feasible functions. 24th IEEE Symp. on Found. of Comp. Sci. (1983), 439–445.
Jia-Wei Hong: On similarity and duality of computation (I). Information and Control, 62 (1984), 109–128.
R. Hockney, C. Jesshope: Parallel Computers. Adam Hilger Ltd, Bristol 1981.
J. Hopcroft, J. Ullman: Introduction to automata theory, languages, and computation. Addison-Wesley, Reading (Mass.) 1979.
R. Karp, R. Lipton: Some connections between non-uniform and uniform complexity classes. 12th ACM Symp. Th. of Comp. (1980), 302–309.
Ker-I Ko: Resource-bounded program-size complexity and pseudo-random sequences. Preprint, 1984.
W. Peterson: Vector FORTRAN for numerical problems on CRAY-1. Communications ACM, 26 (1983), 1008–1021.
V. Pratt, L. Stockmeyer: A characterization of the power of vector machines. Journal of Comp. and Syst. Sci. 12 (1978), 198–211.
R. Russell: The CRAY-1 computer system. Communications ACM, 21 (1978), 63–72.
J. Savage: The complexity of computing. Wiley Interscience, 1976.
U. Schöning: On small generators. Theor. Comp. Sci. 34 (1984), 337–341.
U. Schöning: Complexity and structure. Lecture notes in Computer Science 211, Springer-Verlag 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balcázar, J.L., Díaz, J., Gabarró, J. (1986). On non-uniform polynomial space. In: Selman, A.L. (eds) Structure in Complexity Theory. Lecture Notes in Computer Science, vol 223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16486-3_88
Download citation
DOI: https://doi.org/10.1007/3-540-16486-3_88
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16486-9
Online ISBN: 978-3-540-39825-7
eBook Packages: Springer Book Archive