An observation on probability versus randomness with applications to complexity classes-Reference-Cited by-同舟云学术

An observation on probability versus randomness with applications to complexity classes

Published:1994-05 Issue:3 Volume:27 Page:201-209
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Book Ronald V.,Lutz Jack H.,Wagner Klaus W.

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/BF01578842.pdf

Reference18 articles.

1. K. Ambos-Spies. Randomness, relativations, and polynomial reducibilities.Proc. First Conf. on Structure in Complexity Theory, Lecture Notes in Computer Science, Vol. 223, Springer-Verlag, Berlin, 1986, pp. 23–34.

2. J. Balcázar, R. Book, and U. Schöning. The polynomial-time hierarchy and sparse oracles.J. Assoc. Comput. Mach., 33:603–617, 1986.

3. J. Balcázar, J. Díaz, and J. Gabarró.Structural Complexity I. Springer-Verlag, Berlin, 1988.

4. J. Balcázar, J. Díaz, and J. Gabarró.Structural Complexity II. Springer-Verlag, Berlin, 1990.

5. C. Bennett. Logical depth and physical complexity. InThe Universal Turing Machine: A Half-Century Survey (R. Herken, ed.), Oxford University Press, Oxford, 1988, pp. 227–257.

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

1. Polynomial-Time Random Oracles and Separating Complexity Classes;ACM Transactions on Computation Theory;2021-03

2. Limits on the computational power of random strings;Information and Computation;2013-01

3. Limits on the Computational Power of Random Strings;Automata, Languages and Programming;2011

4. Dimension Extractors and Optimal Decompression;Theory of Computing Systems;2007-07-06

5. Lattice Embeddings for Abstract Bounded Reducibilities;SIAM Journal on Computing;2002-01