Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. L. Babai and S. Moran. Arthur-Merlin games: a randomized proof-system, and a hierarchy of complexity classes. Journal of Computer and System Sciences 36 (1988) 254–276, 36:254–276, 1988.
2. B. v. Braunmühl. Alternationshierarchien von Turingmaschinen mit kleinem Speicher. Informatik Berichte 83, Inst. für Informatik, Universität Bonn, 1991.
3. J. Hastad. Almost optimal lower bounds for small depth circuits. In Proc. 18. STOC, pages 6–20, 1986.
4. L. A. Hemachandra. The strong exponential hierarchy collapses. In Proc. 19th. STOC Conference, pages 110–122, 1987.
5. A. Ito, K. Inoue, and I. Takanami. A note on alternating Turing machines using small space. The Transactions of the IEICE, E 70 no. 10:990–996, 1987.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Sublogarithmic Alternating Space World;SIAM Journal on Computing;1996-08
2. Editorial note;Lecture Notes in Computer Science;1993