Author:
Dessmark Anders,Lingas Andrzej,Lundell Eva-Marta
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Alon, N., Seymour, P., Thomas, R.: A separator Theorem for Graphs with an Excluded Minor and its Applications. In: 22nd ACM STOC, pp. 293–299 (1990)
2. Arora, S.: Polynomial-time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM 45(5), 753–782 (1998)
3. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)
4. Berger, B., Leighton, T.: Protein Folding in the Hydrophobic-Hydrophilic (HP) Model is NP-Complete. In: Proc. RECOMB 1998, New York, pp. 30–39 (1998)
5. Crescenzi, P., Goldman, D., Papadimitriou, C.H., Piccolboni, A., Yannakakis, M.: On the complexity of protein folding. Journal of Computational Biology 5(3), 423–466 (1998)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Solving Hard Problems by Protein Folding?;Theory and Practice of Natural Computing;2020