✦ LIBER ✦

On the computational complexity of an external pin assignment problem

✍ Scribed by Tsutomu Kimoto; Shuji Tsukiyama; Isao Shirakawa; Regular Members

Book ID: 112074879
Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 570 KB
Volume: 67
Category: Article
ISSN: 8756-6621
DOI: 10.1002/ecja.4400671105

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The computational complexity of bilevel

The computational complexity of bilevel assignment problems

✍ Elisabeth Gassner; Bettina Klinz 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 282 KB

On the computational complexity of the m

On the computational complexity of the maximum trade problem

✍ Z. -Q. Luo; D. L. Parnas 📂 Article 📅 1994 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 617 KB

On the Computational Complexity of the M

On the Computational Complexity of the Minimum Committee Problem

✍ Mikhail Yu. Khachay 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 442 KB

On the computational complexity of a mer

On the computational complexity of a merge recognition problem

✍ Anthony Mansfield 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 260 KB

The computational complexity of the reli

The computational complexity of the reliability problem on distributed systems

✍ Min-Sheng Lin; Deng-Jyi Chen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 450 KB

The reliability of a distributed program in a distributed computing system is the probability that a program which runs on multiple processing elements and needs to communicate with other processing elements for remote data files will be executed successfully. This reliability varies according to (

A very personal reminiscence on the prob

A very personal reminiscence on the problem of computational complexity

✍ Masao Iri 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 791 KB