✦ LIBER ✦

On the complexity of designing optimal branch-and-combine clock networks

✍ Scribed by El-Amawy, A.; Kulasinghe, P.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal procedures and complexity analys

✍ Chae Y. Lee 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 855 KB

On the complexity of resilient network d

✍ Artur Tomaszewski; Michał Pióro; Mateusz Żotkiewicz 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 354 KB

On the complexity of the one-terminal ne

✍ Nimrod Megiddo 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 225 KB

Design and Optimization of the Extended

✍ Xiao Peng Yu; Manh Anh Do; Wei Meng Lim; Kiat Seng Yeo; Jian-Guo Ma 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 921 KB

Single-exception sorting networks and th

✍ Ian Parberry 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 775 KB

On the complexity of directed biological

✍ Bonchev, D. 📂 Article 📅 2003 🏛 Taylor and Francis Group 🌐 English ⚖ 370 KB