Author:
Dantsin Evgeny,Goerdt Andreas,Hirsch Edward A,Kannan Ravi,Kleinberg Jon,Papadimitriou Christos,Raghavan Prabhakar,Schöning Uwe
Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. Information Theory;Ash,1965
2. Search Methods for Artificial Intelligence;Bolc,1992
3. Covering Codes;Cohen,1997
4. E. Dantsin, Two propositional proof systems based on the splitting method (in Russian). Zapiski Nauchnykh Seminarov LOM1, 105 (1981) 24–44 (English translation: Journal of Soviet Mathematics, 22(3) (1983) 1293–1305.)
5. J. Gu, Q.-P. Gu, Average time complexity of the SAT 1.2 algorithm, in: D.-Z. Du, X.-S. Zhang (Eds.), Proc. Fifth Annu. Internat. Symp. Algorithms Comput., ISAAC’94, Lecture Notes in Computer Science, vol. 834, Springer, Berlin, 1994, pp. 146–154.
Cited by
128 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献