✦ LIBER ✦

On the computational complexity of a merge recognition problem

✍ Scribed by Anthony Mansfield

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 260 KB
Volume: 5
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(83)90021-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 (

On the computational complexity of the m

On the computational complexity of the minimum-dummy-activities problem in a pert network

✍ Maciej M. Syslo 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 454 KB

There Exists a Problem Whose Computation

There Exists a Problem Whose Computational Complexity Is Any Given Function of the Information Complexity

✍ Ming Chu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 192 KB

Maximizing a lower bound on the computat

Maximizing a lower bound on the computational complexity

✍ Georg Gati 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 294 KB

On the computational complexity of graph

On the computational complexity of graph closures

✍ Angelo Monti 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 375 KB