Advertisement

On non-uniform polynomial space

  • J. L. Balcázar
  • J. Díaz
  • J. Gabarró
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 223)

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.

Keywords

Turing Machine Transitive Closure Kolmogorov Complexity Polynomial Space Polynomial Size 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J.L. Balcázar, J. Gabarró: Connections among non-uniform models for problems requiring a high amount of resources. Preprint, 1985.Google Scholar
  2. [2]
    R. Book: Simple characterizations of certain classes of languages. Journal ACM 25 (1978), 23–31.Google Scholar
  3. [3]
    R. Book: Polynomial space and transitive closure. SIAM J. Computing 8 (1979), 434–439.Google Scholar
  4. [4]
    R. Book: On languages accepted by space-bounded oracle machines. Acta Informatica 12 (1979), 177–185.Google Scholar
  5. [5]
    P. Dymond, S. Cook: Hardware complexity and parallel computation. 21th IEEE Symp. on Found. of Comp. Sci. (1980), 360–371.Google Scholar
  6. [6]
    L. Goldschlager: A unified approach to models of synchronous parallel machines. 10th ACM Symp. on Theory of Comp. (1978), 89–94.Google Scholar
  7. [7]
    G. Goodrich, R. Ladner, M, Fischer: Straight-line programs to compute finite languages. Conf. Theor. Comp. Sci., Waterloo 1977.Google Scholar
  8. [8]
    J. Hartmanis: Generalized Kolmogorov complexity and the structure of feasible functions. 24th IEEE Symp. on Found. of Comp. Sci. (1983), 439–445.Google Scholar
  9. [9]
    Jia-Wei Hong: On similarity and duality of computation (I). Information and Control, 62 (1984), 109–128.Google Scholar
  10. [10]
    R. Hockney, C. Jesshope: Parallel Computers. Adam Hilger Ltd, Bristol 1981.Google Scholar
  11. [11]
    J. Hopcroft, J. Ullman: Introduction to automata theory, languages, and computation. Addison-Wesley, Reading (Mass.) 1979.Google Scholar
  12. [12]
    R. Karp, R. Lipton: Some connections between non-uniform and uniform complexity classes. 12th ACM Symp. Th. of Comp. (1980), 302–309.Google Scholar
  13. [13]
    Ker-I Ko: Resource-bounded program-size complexity and pseudo-random sequences. Preprint, 1984.Google Scholar
  14. [14]
    W. Peterson: Vector FORTRAN for numerical problems on CRAY-1. Communications ACM, 26 (1983), 1008–1021.Google Scholar
  15. [15]
    V. Pratt, L. Stockmeyer: A characterization of the power of vector machines. Journal of Comp. and Syst. Sci. 12 (1978), 198–211.Google Scholar
  16. [16]
    R. Russell: The CRAY-1 computer system. Communications ACM, 21 (1978), 63–72.Google Scholar
  17. [17]
    J. Savage: The complexity of computing. Wiley Interscience, 1976.Google Scholar
  18. [18]
    U. Schöning: On small generators. Theor. Comp. Sci. 34 (1984), 337–341.Google Scholar
  19. [19]
    U. Schöning: Complexity and structure. Lecture notes in Computer Science 211, Springer-Verlag 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • J. L. Balcázar
    • 1
  • J. Díaz
    • 1
  • J. Gabarró
    • 1
  1. 1.Facultat d'Informática de Barcelona (UPC)BarcelonaSpain

Personalised recommendations