Is DNA computing viable for 3-SAT problems?

Author： Li D.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.290, Iss.3, 2003-01, pp. : 2095-2107

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Random 2-SAT: results and problems

By Fernandez de la Vega W.  

Theoretical Computer Science, Vol. 265, Iss. 1, 2001-08 ,pp. : 131-146

Elsevier

Access to resources Recommend Favorite

Exact Max-SAT solvers for over-constrained problems

By Argelich Josep   Manyà Felip  

Journal of Heuristics, Vol. 12, Iss. 4-5, 2006-09 ,pp. : 375-392

Springer Publishing Company

Access to resources Recommend Favorite

Protein output for DNA computing

By Henkel Christian   Bladergroen Reno   Balog Crina   Deelder André   Head Tom   Rozenberg Grzegorz   Spaink Herman  

Natural Computing, Vol. 4, Iss. 1, 2005-01 ,pp. : 1-10

Springer Publishing Company

Access to resources Recommend Favorite

DNA computing in vitro and in vivo

By Kari L.  

Future Generation Computer Systems, Vol. 17, Iss. 7, 2001-05 ,pp. : 823-834

Elsevier

Access to resources Recommend Favorite

DNA computing by blocking

By Rozenberg G.   Spaink H.  

Theoretical Computer Science, Vol. 292, Iss. 3, 2003-01 ,pp. : 653-665

Elsevier

Access to resources Recommend Favorite