Complexity of the $r$-query Tautologies in the Presence of a Generic Oracle
-
Published:2000-04-01
Issue:2
Volume:41
Page:
-
ISSN:0029-4527
-
Container-title:Notre Dame Journal of Formal Logic
-
language:
-
Short-container-title:Notre Dame J. Formal Logic
Publisher
Duke University Press
Reference21 articles.
1. Ambos-Spies, K., H. Fleischhack, and H. Hagen, "$p$-generic sets", pp. 58–68 in Automata, Languages and Programming (Antwerp, 1984), edited by J. Paredaens, Springer-Verlag, Berlin, 1984. 2. Baker, T., J. Gill, and R. Solovay, "Relativizations of the $\mathcal{P}=$?$\mathcal{N\!P}$ question", SIAM Journal on Computing, vol. 4 (1975), pp. 431–42. 3. Balcázar, J. L., R. V. Book, and U. Sch öning, "On bounded query machines", Theoretical Computer Science, vol. 40 (1985), pp. 237–43. 4. Balcázar, J. L., J. Díaz, and J. Gabarró, Structural Complexity. I, Springer-Verlag, Berlin, 2d edition, 1995. 5. Bennett, C. H., and J. Gill, "Relative to a random oracle ${A}$, P$^{A}\not=$ NP$^{A}\not=$ co-NP$^{A}$ with probability $1$", SIAM Journal on Computing, vol. 10 (1981), pp. 96–113.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
|
|