On Space-bounded Synchronized Alternating Turing Machines
暂无分享,去创建一个
[1] Anna Slobodová. On the Power of Communication in Alternating Machines , 1988, MFCS.
[2] Wolfgang J. Paul,et al. An Information-Theoretic Approach to Time Bounds for On-Line Computation , 1981, J. Comput. Syst. Sci..
[3] Anna Slobodová,et al. On the Power of Synchronization in Parallel Computations , 1989, MFCS.
[4] Anna Slobodová. Some Properties of Space-Bounded Synchronized Alternating Turing Machines with Only Universal States , 1988, IMYCS.
[5] Ming Li,et al. Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87 , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.
[6] Neil Immerman,et al. Nondeterministic space is closed under complementation , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.
[7] Katsushi Inoue,et al. Alternating On-Line Turing Machines with Only Universal States and Small Space Bounds , 1985, Theor. Comput. Sci..
[8] I. Takanami,et al. A note on alternating turing machines using small space , 1987 .
[9] Andrew Chi-Chih Yao,et al. K + 1 heads are better than K , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[10] Oscar H. Ibarra,et al. Some Observations Concerning Alternating Turing Machines Using Small Space , 1987, Inf. Process. Lett..