Author:
Liu ChenGuang,Tanaka Kazuyuki
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Blum, M., Impagliazzo, R.: Generic Oracles and Oracle Classed. In: Proceedings of the 28th Annual Symposium on Foundations of Computer science(FOCS), pp. 118–126 (1987)
2. Hartmanis, J., Hemachandra, L.A.: Complexity classes without machines: on complete languages for UP. Theoretical Computer Science 58(1-3), 129–142 (1988)
3. Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artificial Intelligence. 6, 293–326 (1975)
4. Liu, C.G., Tanaka, K.: The Complexity of Algorithms Computing Game Trees on Random Assignments. In: Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management, Portland,OR, USA, June, 2007. LNCS, vol. 4508, pp. 241–250 (2007)
5. Saks, M., Wigderson, A.: Probabilistic Boolean Decision Trees and the Complexity of Evaluating Game Trees. In: Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer science(FOCS), pp. 29–38. IEEE Computer Society Press, Los Alamitos (1986)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献