The future of computational complexity theory: part I
暂无分享,去创建一个
[1] Bart Selman,et al. The Comparative Linguistics of Knowledge Representation , 1995, IJCAI.
[2] G. Cowan,et al. Complexity Metaphors, Models, and Reality , 1994 .
[3] Michael A. Trick,et al. How hard is it to control an election? Math , 1992 .
[4] John N. Tsitsiklis,et al. On the predictability of coupled automata: an allegory about chaos , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[5] Lane A. Hemaspaandra,et al. Worlds to die for , 1995, SIGA.
[6] D. E. Knuth,et al. A terminological proposal , 1974, SIGA.
[7] Mihalis Yannakakis,et al. On complexity as bounded rationality (extended abstract) , 1994, STOC '94.
[8] Marius Zimand,et al. How to Privatize Random Bits , 1996 .
[9] Christos H. Papadimitriou,et al. The complexity of knowledge representation , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).
[10] Xiaotie Deng,et al. On the Complexity of Cooperative Solution Concepts , 1994, Math. Oper. Res..
[11] Mihalis Yannakakis,et al. Testing the Universal Instance Assumption , 1980, Inf. Process. Lett..