A time-space hierarchy between polynomial time and polynomial space-Reference-Cited by-同舟云学术

A time-space hierarchy between polynomial time and polynomial space

Published:1992-06 Issue:2 Volume:25 Page:77-92
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Clote P.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02835830.pdf

Reference24 articles.

1. M. Blum and R. Impagliazzo, Generic oracles and oracle classes,Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science (1988), pp. 118–126.

2. R. V. Book, C. B. Wilson, and Xu Mei-Rui, Relativizing time, space, and time-space,SIAM Journal on Computing,11 (1982), 571–581.

3. Studies in Proof Theory;S. R. Buss,1986

4. J. F. Buss, Relativized alternation and space-bounded computation,Journal of Computer and System Sciences,36(3) (1988), 351–378.

5. P. Clote, A smash-based hierarchy betweenPTIME andPSPACE (preliminary version), inContemporary Mathematics, vol. 106 ed. W. Sieg, Birkhäuser, Boston (1990), pp. 85–100.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes;Lecture Notes in Computer Science;2000

2. Computation Models and Function Algebras;Handbook of Computability Theory;1999

3. Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy;Lecture Notes in Computer Science;1997

4. Computation models and function algebras;Lecture Notes in Computer Science;1995