A DNA algorithm for SAT, the satisfiabilityof propositional formulae, is presented where the number of separation steps is given by the number of clauses of the instance. This represents a computational improvement for DNA algorithms based on Adleman and Lipton’s extraction model, where the number of separations equates the number of literals of the instance

Manca, V., Zandron, C. (2002). A clause string DNA algorithm for SAT. In 7th International Workshop on DNA-Based Computers, DNA 2001; Tampa; United States; 10 June 2001 through 13 June 2001 (pp.172-181). Springer Verlag.

A clause string DNA algorithm for SAT

ZANDRON, CLAUDIO
Ultimo
2002

Abstract

A DNA algorithm for SAT, the satisfiabilityof propositional formulae, is presented where the number of separation steps is given by the number of clauses of the instance. This represents a computational improvement for DNA algorithms based on Adleman and Lipton’s extraction model, where the number of separations equates the number of literals of the instance
paper
Computer Science (all); Theoretical Computer Science
English
International Workshop on DNA-Based Computers, DNA 10-13 June
2001
7th International Workshop on DNA-Based Computers, DNA 2001; Tampa; United States; 10 June 2001 through 13 June 2001
3540437754
2002
2340
172
181
http://springerlink.com/content/0302-9743/copyright/2005/
none
Manca, V., Zandron, C. (2002). A clause string DNA algorithm for SAT. In 7th International Workshop on DNA-Based Computers, DNA 2001; Tampa; United States; 10 June 2001 through 13 June 2001 (pp.172-181). Springer Verlag.
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/136143
Citazioni
  • Scopus 12
  • ???jsp.display-item.citation.isi??? ND
Social impact