𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Probabilistic Robustness Analysis—Risks, Complexity, and Algorithms

✍ Scribed by Chen, Xinjia; Zhou, Kemin; Aravena, Jorge


Book ID
118205664
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
392 KB
Volume
47
Category
Article
ISSN
0363-0129

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Complexity analysis of the SAT engine: D
✍ Masami Hagiya; John A. Rose; Ken Komiya; Kensaku Sakamoto 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 123 KB

Taking advantage of the power of DNA molecules to spontaneously form hairpin structures, Sakamoto et al. designed a molecular algorithm to solve instances of the satisÿability problem on Boolean expressions in clausal form (the SAT problem), and by developing new experimental techniques for molecula