Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

38

DNA
2005
Springer

favoriteEmaildiscussreport

130views Bioinformatics» more DNA 2005»

An Algorithm for SAT Without an Extraction Phase

14 years 4 months ago

An Algorithm for SAT Without an Extraction Phase

Download www.macs.hw.ac.uk

An algorithm that could be implemented at a molecular level for solving the satisﬁability of Boolean expressions is presented. This algorithm, based on properties of speciﬁc sets of natural numbers, does not require an extraction phase for the read out of the solution.

Pierluigi Frisco, Christiaan Henkel, Szabolcs Teng

Real-time Traffic

Boolean Expressions | DNA 2005 | Molecular Level | Speciﬁc Sets |

claim paper

Related Content

» DPPlan An Algorithm for Fast Solutions Extraction from a Planning Graph

» Parallel Processing of Recursive Queries in Distributed Architectures

» An Algorithm to Extract Rules from Artificial Neural Networks for Medical Diagnosis Proble...

» Accelerating phase unwrapping and affine transformations for optical quadrature microscopy...

» Information Hiding in Finite State Machine

» Segmenting Point Sets

» MultiModal Registration of Embryonic Images for In Vitro Fertilization

» Reusing relational sources for semantic information access

» High performance XSLFO rendering for variable data printing

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	DNA
Authors	Pierluigi Frisco, Christiaan Henkel, Szabolcs Tengely

Comments (0)