Title :
Contextual-insertion to solve #P version of the Square-Tiling Problem
Author_Institution :
Madras Christian Coll., Chennai, India
Abstract :
It has been of interest to provide solutions to NP-Hard problems making use of DNA computing. These provide “Yes” or “No” answer. In this paper, we make use of “Contextual Insertion” to give a solution to the #P complete version of the Square Tiling Problem which is known to be NP-Hard.
Keywords :
biocomputing; computational complexity; #P complete version; DNA computing; NP-hard problems; contextual-insertion; square-tiling problem;
Conference_Titel :
Bio-Inspired Computing: Theories and Applications (BIC-TA), 2010 IEEE Fifth International Conference on
Conference_Location :
Changsha
Print_ISBN :
978-1-4244-6437-1
DOI :
10.1109/BICTA.2010.5645075
