This paper demonstrates that some practical 3SAT algorithms on conventional computers can be implemented on a DNA computer as a polynomial time breadth first search procedure based only on the fundamental chemical operations identified by Adleman and Lipton’s method.
A DNA Algorithm for 3-SAT (11,20)*
MANCA, Vincenzo;VALLINI, Giovanni;
2001-01-01
Abstract
This paper demonstrates that some practical 3SAT algorithms on conventional computers can be implemented on a DNA computer as a polynomial time breadth first search procedure based only on the fundamental chemical operations identified by Adleman and Lipton’s method.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
