Molecular computing, bounded nondeterminism, and efficient recursion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 816-826

  Beigel, Richard ^a   Fu, Bin ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

3-COLORABILITY; INDEPENDENT SET; MOLECULAR ALGORITHM; MOLECULAR COMPUTATIONS; MOLECULAR COMPUTING; NON-DETERMINISM; POLYNOMIAL NUMBER; RECURSIVE ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 21744457679     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_234     Document Type: Conference Paper

References (30)

1. L. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021-1024, Nov. 1994.
2. L. Adleman. On constructing a molecular computer. In 1st DIMACS workshop on DNA Computing, 1995.
3. E. Bach, A. Condon, E. Glaser, and C. Tanguay. DNA models and algorithms for NP-complete problems. In Proc. 11th Ann. Conf. Structure in Complexity Theory, pp. 290-299, 1996.
4. D. Beaver. A universal molecular computer. CSE 95-001, Perm. State Univ., 1995.
5. R. Beigel. Maximum independent set algorithms. Manuscript, 1996.
6. R. Beigel and D. Eppstein. 3-coloring in time 0(1.3446n): a no-MIS algorithm. In Proc. 36th IEEE FOGS, pp. 444-452, 1995.
7. R. Beigel and J. Goldsmith. Downward separation fails catastrophically for limited nondeterminism classes. In Proc. 9th Ann. Conf. Structure in Complexity Theory, pp. 134-138, 1994.
8. D. Boneh, C. Dunworth, R. J. Lipton, and J. Sgall. On the computational power of DNA. Manuscript, 1996.
9. J. F. Buss and J. Goldsmith. Nondeterminism within P. SICOMP, 22:560-572, 1993.
10. J. D. C. Alvarez and J. Toran. Complexity classes with complete problems between P and NP-complete. In Foundations of Computation Theory, pp. 13-24. Springer-Verlag, 1989. LNCS 380.
11. J. Diaz and J. Toran. Classes of bounded nondeterminism. MST, 23:21-32, 1990.
12. J. Goldsmith, M. Levy, and M. Mundhenk. Limited nondeterminism. SIGACT News, pp. 20-29, June 1996.
13. L. Hemachandra and S. Jha. Defying upward and downward separation. In Proc. 10th STAGS, pp. 185-195. Springer-Verlag, 1993. LNCS 665.
14. C. M. R. Kintala. Computations with a restricted number of nondeterministic steps. PhD thesis, Penn. State Univ., University Park, PA, 1977.
15. C. M. R. Kintala and P. C. Fischer. Computations with a restricted number of nondeterministic steps. In Proc. 9th ACM STOC, pp. 178-185, 1977.
16. C. M. R. Kintala and P. C. Fischer. Refining nondeterminism in relativized polynomial-time bounded computations. SICOMP, 9(l):46-53, Feb. 1980.
17. R. Lipton. Using DNA to solve NP-complete problems. Science, 268:542-545, Apr. 1995.
18. B. Monien and E. Speckenmeyer. Solving satisfiability in less than 2" steps. Discrete Appl Math., 10:287-295, 1985.
19. M. Ogihara. Breadth first search 3SAT algorithms for DNA computers. TR 629, U. Rochester, July 1996.
20. C. H. Papadimitriou and M. Yannakakis. On limited nondeterminism and the complexity of the V-C dimension. In Proc. 8th Ann. Conf. Structure in Complexity Theory, pp. 12-18, 1993.
21. N. Pippenger and M. Fischer. Relations among complexity measures. J. ACM, 26, 1979.
22. J. Robson. Algorithms for maximum independent sets. J. Algorithms, 7:425-440, 1986.
23. D. Roos and K. Wagner. On the power of bio-computers. TR, U. of Wurzburg, Feb. 1995. ftp://haegar.informatik.um-wuerzburg.de/pub/TRs/ro-wa95.ps.gz
24. P. Rothemund. A DNA and restriction enzyme implementation of Turing machines. http://www.uges.caltech.edu/tt~pwkr/oett.htnil.
25. L. Sanchis. Constructing language instances based on partial information. International Jour. Found. Comp. Sci., 5(2):209-229, 1994.
26. I. Schiermeyer. Pure literal lookahead: An 0(1,497") 3-satisfiability algorithm. Manuscript, August 14, 1996.
27. C. P. Schnorr. Optimal algorithms for self-reducible problems. In Proc. 3rd ICALP, pp. 322-337, 1976.
28. A. L. Selman. Natural self-reducible sets. TR, Northeastern Univ., 1986.
29. W. Smith and A. Schweitzer. DNA computers in vitro and vivo. TR, NEC, 1995.
30. R. Tarjan. Finding a maximum clique. TR 72-123, Cornell Univ., 1972.