Author:
Marino Raffaele,Parisi Giorgio,Ricci-Tersenghi Federico
Publisher
Springer Science and Business Media LLC
Subject
General Physics and Astronomy,General Biochemistry, Genetics and Molecular Biology,General Chemistry
Reference45 articles.
1. Cook, S. A. The complexity of theorem proving procedures, Proc. 3rd Ann. 151–158 (ACM Symp. on Theory of Computing, Assoc. Comput. Mach., New York, (1971).
2. Garey, M. & Johnson, D. S. Computers and Intractability; A guide to the theory of NP-completeness Freeman (1979).
3. Papadimitriou, C. H. Computational Complexity Addison-Wesley (1994).
4. Mézard, M. & Montanari, A. Information, Physics, and Computation Oxford University Press (2009).
5. Moore, C. & Mertens, S. The Nature of Computation Oxford University Press (2011).
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献