✦ LIBER ✦

Fast Algorithms for the Density Finding Problem

✍ Scribed by D. T. Lee; Tien-Ching Lin; Hsueh-I Lu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast algorithms for finding disjoint sub

✍ Anders Bergkvist; Peter Damaschke 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 409 KB

Fast algorithms for the maximum convolut

✍ Michael Bussieck; Hannes Hassler; Gerhard J. Woeginger; Uwe T. Zimmermann 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 487 KB

Fast search algorithms for the n-queens

✍ Sosic, R.; Gu, J. 📂 Article 📅 1991 🏛 Institute of Electrical and Electronics Engineers ⚖ 566 KB

Fast parallel algorithms for the maximum

✍ Zhaofang Wen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 414 KB

A fast algorithm for finding the compact

✍ Dejan Zivkovic 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 407 KB

A fast algorithm for finding interlockin

✍ Errol L. Lloyd 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 354 KB