✦ LIBER ✦

Analysis of an efficient algorithm for the hard-sphere problem

✍ Scribed by Krantz, Alan T.

Book ID: 121266947
Publisher: Association for Computing Machinery
Year: 1996
Tongue: English
Weight: 471 KB
Volume: 6
Category: Article
ISSN: 1049-3301
DOI: 10.1145/235025.235030

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for the linear as

An efficient algorithm for the linear assignment problem

✍ Shoichiro Yamada; Tamotsu Kasai 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 668 KB

An efficient algorithm for the 3-satisfi

An efficient algorithm for the 3-satisfiability problem

✍ Alain Billionnet; Alain Sutter 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 543 KB

An efficient algorithm for the “stable r

An efficient algorithm for the “stable roommates” problem

✍ Robert W Irving 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 938 KB

An Efficient Algorithm for the Complex R

An Efficient Algorithm for the Complex Roots Problem

✍ C.Andrew Neff; John H. Reif 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 406 KB

Given a univariate polynomial f (z) of degree n with complex coefficients, whose norms are less than 2 m in magnitude, the root problem is to find all the roots of f (z) up to specified precision 2 ϪȐ . Assuming the arithmetic model for computation, we provide an algorithm which has complexity O(n l

An efficient algorithm for the bipartite

An efficient algorithm for the bipartite matching problem

✍ Paolo Carraresi; Claudio Sodini 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 612 KB

An Efficient Algorithm for the Knapsack

An Efficient Algorithm for the Knapsack Sharing Problem

✍ Mhand Hifi; Slim Sadfi; Abdelkader Sbihi 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 205 KB