Skip to main content
Log in

A Comparison of Resource-Bounded Molecular Computation Models

  • Published:
Algorithmica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received September 28, 1997; revised March 24, 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fu, B., Beigel, R. A Comparison of Resource-Bounded Molecular Computation Models . Algorithmica 24, 87–95 (1999). https://doi.org/10.1007/PL00009276

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00009276

Keywords

Navigation