Using DNA to solve the Bounded Post Correspondence Problem

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.231, Iss.2, 2000-01, pp. : 193-203

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

Flatwords and Post Correspondence Problem

By Harju T. Lipponen M. Mateescu A.

Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. : 93-108

Elsevier

Access to resources Recommend Favorite

Binary (generalized) Post Correspondence Problem

By Halava V. Harju T. Hirvensalo

Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. : 183-204

Elsevier

Access to resources Recommend Favorite

Using GRASP to Solve the Unit Commitment Problem

By Viana A.

Annals of Operations Research, Vol. 120, Iss. 1-4, 2003-04 ,pp. : 117-132

Springer Publishing Company

Access to resources Recommend Favorite

Using N-D method to solve multi-response problem in Taguchi

By Liao Hung-Chang

Journal of Intelligent Manufacturing, Vol. 16, Iss. 3, 2005-06 ,pp. : 331-347

Springer Publishing Company

Access to resources Recommend Favorite

Using an evolutionary algorithm to solve the weighted view materialisation problem for data warehouses

By Wagner Neal Agrawal Vikas

International Journal of Intelligent Information and Database Systems, Vol. 7, Iss. 2, 2013-04 ,pp. : 163-179

Inderscience Publishers

Access to resources Recommend Favorite