𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A problem solved

✍ Scribed by Sharon G. Boots

Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
112 KB
Volume
74
Category
Article
ISSN
0022-3549

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Hidden-line problem solved
Hidden-line problem solved
πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 101 KB
Covering Graphs: The Covering Problem So
Covering Graphs: The Covering Problem Solved
✍ Yair Caro; Raphael Yuster πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 238 KB

For every fixed graph H, we determine the H-covering number of K n , for all n>n 0 (H ). We prove that if h is the number of edges of H, and gcd(H )=d is the greatest common divisor of the degrees of H, then there exists n 0 =n 0 (H ), such that for all n>n 0 , Our main tool in proving this result

Is conformational sampling of drug-like
Is conformational sampling of drug-like molecules a solved problem?
✍ I-Jen Chen; Nicolas Foloppe πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 210 KB πŸ‘ 1 views

## Abstract With computational tools, it has become straightforward to obtain three‐dimensional (3D) conformers for drug‐like molecules, even for large numbers of compounds. This underpins many downstream molecular modeling activities. We summarize the principles behind the methods, explain why con