Author:
Ablayev Farid,Karpinski Marek
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. F. Ablayev, Lower bounds for probabilistic space complexity: communication-automata approach, in Proceedings of the LFCS'94, Lecture Notes in Computer Science, Springer-Verlag, 813, (1994), 1–7.
2. L. Adelman, Two theorems on random polynomial time, in Proceedings of the 19-th FOCS, (1978), 75–83.
3. M. Ajtai and M. Ben-Or, A theorem on randomized constant depth circuits, in Proceedings of the 16-th STOC, (1984), 471–474.
4. C. Bennet and J. Gill, Relative to a random oracle A, P
A ≠ NPA ≠ co — NPA with probability 1, SIAM J. Comput, 10, (1981), 96–113.
5. B. Boiling, M. Sauerhoff, D. Sieling, and I. Wegener, On the power of different types of restricted branching programs, ECCC Reports 1994, TR94-025.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献