All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
暂无分享,去创建一个
[1] W. Daniel Hillis,et al. The connection machine , 1985 .
[2] Grzegorz Rozenberg,et al. Introduction: DNA Computing in a Nutshell , 1998 .
[3] Victor Mitrana,et al. Accepting Networks of Splicing Processors , 2005, CiE.
[4] Luciano De Errico,et al. Towards a new architecture for symbolic processing , 1995 .
[5] Geoffrey E. Hinton,et al. Massively Parallel Architectures for AI: NETL, Thistle, and Boltzmann Machines , 1983, AAAI.
[6] Victor Mitrana,et al. Networks of Evolutionary Processors: Results and Perspectives , 2005 .
[7] D. Sankoff,et al. Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. , 1992, Proceedings of the National Academy of Sciences of the United States of America.
[8] David I. Lewin,et al. DNA computing , 2002, Comput. Sci. Eng..
[9] Marian Gheorghe. Molecular Computational Models: Unconventional Approaches , 2005 .
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] Victor Mitrana,et al. Accepting networks of splicing processors: Complexity results , 2007, Theor. Comput. Sci..
[12] Erzsébet Csuhaj-Varjú,et al. Test Tube Distributed Systems Based on Splicing , 1996, Comput. Artif. Intell..
[13] Gheorghe Paun,et al. Simulation Algorithms for Computational Systems Biology , 2017, Texts in Theoretical Computer Science. An EATCS Series.
[14] John L. Casti,et al. Unconventional Models of Computation , 2002, Lecture Notes in Computer Science.