A Comparison of Resource-Bounded Molecular Computation Models

Abstract. The number of molecular strands used by a molecular algorithm is an important measure of the algorithm's complexity. This measure is also called the volume used by the algorithm. We prove that three important polynomial-time models of molecular computation with bounded volume are equivalent to models of polynomial-time Turing machine computation with bounded nondeterminism. Without any assumption, we show that the Split operation does not increase the power of polynomial-time molecular computation. Assuming a plausible separation between Turing machine complexity classes, the Amplify operation does increase the power of polynomial-time molecular computation.

[1]  Eric Bach,et al.  DNA Models and Algorithms for NP-Complete Problems , 1998, J. Comput. Syst. Sci..

[2]  Klaus W. Wagner,et al.  On the Power of DNA-Computing , 1996, Inf. Comput..

[3]  Jacobo Torán,et al.  Complexity Classes with Complete Problems Between P and NP-C , 1989, FCT.

[4]  R J Lipton,et al.  DNA solution of hard computational problems. , 1995, Science.

[5]  Michael J. Fischer,et al.  Relations Among Complexity Measures , 1979, JACM.

[6]  Lane A. Hemaspaandra,et al.  Defying Upward and Downward Separation , 1993, Inf. Comput..

[7]  Judy Goldsmith,et al.  Nondeterminism Within P , 1993, SIAM J. Comput..

[8]  K. Wagner,et al.  On the Power of Bio-Computers , 1995 .

[9]  Mitsunori Ogihara Breadth First Search 3SAT Algorithms for DNA Computers , 1996 .

[10]  Judy Goldsmith,et al.  Limited nondeterminism , 1996, SIGA.

[11]  Patrick C. Fischer,et al.  Computations with a restricted number of nondeterministic steps (Extended Abstract) , 1977, STOC '77.

[12]  Erik Winfree,et al.  Complexity of restricted and unrestricted models of molecular computation , 1995, DNA Based Computers.

[13]  Richard J. Lipton,et al.  On the Computational Power of DNA , 1996, Discret. Appl. Math..

[14]  Richard Beigel,et al.  Downward separation fails catastrophically for limited nondeterminism classes , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[15]  Laura A. Sanchis Constructing Language Instances Based on Partial Information , 1994, Int. J. Found. Comput. Sci..

[16]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[17]  Leonard M. Adleman,et al.  On constructing a molecular computer , 1995, DNA Based Computers.

[18]  Patrick C. Fischer,et al.  Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations , 1980, SIAM J. Comput..

[19]  Mihalis Yannakakis,et al.  On limited nondeterminism and the complexity of the V-C dimension , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[20]  Bin Fu,et al.  Molecular Computing, Bounded Nondeterminism, and Efficient Recursion , 1997, Algorithmica.

[21]  J.,et al.  Using DNA to Solve NP-Complete ProblemsRichard , 1995 .