𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ban on access for foreign scientists poses a problem for partnership

✍ Scribed by Macilwain, Colin

Book ID
109765809
Publisher
Nature Publishing Group
Year
1998
Tongue
English
Weight
217 KB
Volume
391
Category
Article
ISSN
0028-0836

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A lower time bound for the knapsack prob
A lower time bound for the knapsack problem on random access machines
✍ Peter Klein; Friedhelm Meyer Heide πŸ“‚ Article πŸ“… 1983 πŸ› Springer-Verlag 🌐 English βš– 533 KB

a.M. (Fed. Rep.) Summary. We consider random access machines which read the input integer by integer (not bit by bit). For this computational model we prove a quadratic lower bound for the n-dimensional knapsack problem. For this purpose, we combine a method due to Paul and Simon [1] to apply decisi