, Volume 25, Issue 2–3, pp 222–238 | Cite as

Molecular Computing, Bounded Nondeterminism, and Efficient Recursion

  • R. Beigel
  • B. Fu


The maximum number of strands used is an important measure of a molecular algorithm's complexity. This measure is also called the volume used by the algorithm. Every problem that can be solved by an NP Turing machine with b(n) binary nondeterministic choices can be solved by molecular computation in a polynomial number of steps, with four test tubes, in volume 2 b(n) . We identify a large class of recursive algorithms that can be implemented using bounded nondeterminism. This yields improved molecular algorithms for important problems like 3-SAT, independent set, and 3-colorability.

Key words. Molecular computing, Volume, Nondeterminism. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© 1999 Springer-Verlag New York Inc.

Authors and Affiliations

  • R. Beigel
    • 1
  • B. Fu
    • 2
  1. 1.Department of Electrical Engineering and Computer Science, University of Illinois at Chicago, 851 S. Morgan Street, Chicago, IL 60607-7053, USA.
  2. 2.Epson Palo Alto Laboratory, 3145 Porter Drive, Suite 104, Palo Alto, CA 94304, USA,

Personalised recommendations