๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some dimension problems in molecular databases

โœ Scribed by Paul G. Mezey

Book ID
106419541
Publisher
Springer
Year
2008
Tongue
English
Weight
136 KB
Volume
45
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the complexity of some geometric prob
On the complexity of some geometric problems in unbounded dimension
โœ Nimrod Megiddo ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 429 KB

This paper examines the complexity of several geometric problems due to unbounded dimension. The problems considered are: (i) minimum cover of points by unit cubes, (ii) minimum cover of points by unit ball% and (iii) minimum number of lines to hit a set of balls. Each of these problems is proven no

Some Open Problems in Computational Mole
Some Open Problems in Computational Molecular Biology
โœ Tao Jiang; Paul Kearney; Ming Li ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 69 KB

Problem submissions should be precise and succinct. Proposals for guest columns, focusing on problems in a specific research area, are also welcome. Especially welcome are algorithmic problems arising in areas not previously explored by the theoretical computer science community. This column is a