A Survey on Continuous Time Computations, Olivier Bournez, Manuel Campagnolo, New Computational Paradigms. Changing Conceptions of What is Computable. (Cooper, S.B. and L{\"o}we, B. and Sorbi, A., Eds.). New York, Springer-Verlag, pages 383-423. 2008
berkeley.edu
cs.berkeley.edu
Richard M. Karp (1972), «Reducibility Among Combinatorial Problems»(PDF), in: R. E. Miller and J. W. Thatcher (editors), Complexity of Computer Computations, New York: Plenum, pp. 85–103
Berger, Bonnie A.; Leighton, T (1998), «Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete», Journal of Computational Biology, 5 (1): 27–40, PMID9541869, doi:10.1089/cmb.1998.5.27.
Arvind, Vikraman; Kurur, Piyush P. (2006), «Graph isomorphism is in SPP», Information and Computation, 204 (5): 835–852, doi:10.1016/j.ic.2006.02.002.
Berger, Bonnie A.; Leighton, T (1998), «Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete», Journal of Computational Biology, 5 (1): 27–40, PMID9541869, doi:10.1089/cmb.1998.5.27.
