Solving Constraint Satisfaction Problems with DNA Computing

Authors:
Evgeny Dantsin;Alexander Wolpert
Affiliations:
-;-
Venue:
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Year:
2002

Citing 8
Cited 1

Molecular computation of solutions to combinatorial problems

Science
Randomized algorithms

Randomized algorithms
Error-resilient DNA computation

Random Structures & Algorithms - Special issue on statistical physics methods in discrete probability, combinatorics, and theoretical computer science
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
A Space-Efficient Randomized DNA Algorithm for k-SAT

DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
DNA models and algorithms for NP-complete problems

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Solving Intractable Problems with DNA Computing

COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Dna computation: Theory, practice, and prospects

Evolutionary Computation

Propositional Satisfiability and Constraint Programming: A comparative survey

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We demonstrate how to solve constraint satisfaction problems (CSPs) with DNA computing. Assuming that DNA operations can be faulty, we estimate error probability of our algorithm. We show that for any k-CSP, there is a polynomial-time DNA algorithm with bounded probability of error. Thus, k-CSPs belong to a DNA analogue of BPP.