A generalization of resource-bounded measure, with an application (Extended abstract)-Reference-Cited by-同舟云学术

A generalization of resource-bounded measure, with an application (Extended abstract)

Published:1998 Issue: Volume: Page:161-171
ISSN:0302-9743
Container-title:STACS 98
language:
Short-container-title:

Author:

Buhrman Harry,van Melkebeek Dieter,Regan Kenneth W.,Sivakumar D.,Strauss Martin

Publisher

Springer Berlin Heidelberg

Link

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

Reference16 articles.

1. Allender, E., Strauss, M.: Measure on small complexity classes, with applications for BPP. DIMACS TR 94-18, Rutgers University and DIMACS, April 1994.

2. Allender, E., Strauss, M.: Measure on P: Robustness of the notion. In Proc. 20th International Symposium on Mathematical Foundations of Computer Science, volume 969 of Lect. Notes in Comp. Sci., pages 129–138. Springer Verlag, 1995.

3. Ambos-Spies, K.: P-mitotic sets. In E. Börger, G. Hasenjäger, and D. Roding, editors, Logic and Machines, Lecture Notes in Computer Science 177, pages 1–23. Springer-Verlag, 1984.

4. Ambos-Spies, K., Lempp, S.: Presentation at a Schloss Dagstuhl workshop on “Algorithmic Information Theory and Randomness,” July 1996.

5. Babai, L.: Trading group theory for randomness. In Proc. 17th Annual ACM Symposium on the Theory of Computing, pages 421–429, 1985.

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

1. On the Autoreducibility of Random Sequences;Lecture Notes in Computer Science;2000

2. Bias Invariance of Small Upper Spans;STACS 2000;2000

3. Almost Complete Sets;STACS 2000;2000

4. Randomness vs. completeness: On the diagonalization strength of resource-bounded random sets;Mathematical Foundations of Computer Science 1998;1998