✦ LIBER ✦

A note on the parallel complexity of anti-unification

✍ Scribed by G. M. Kuper; K. W. McAloon; K. V. Palem; K. J. Perry

Publisher: Springer Netherlands
Year: 1992
Tongue: English
Weight: 461 KB
Volume: 9
Category: Article
ISSN: 0168-7433
DOI: 10.1007/bf00245297

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on parallel complexity of maximum

A note on parallel complexity of maximum f-matching

✍ Anders Dessmark; Oscar Garrido; Andrzej Lingas 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 306 KB

We present a randomized NC solution to the problem of constructing a maximum (cardinality) f-matching. constraints. @ 1998 Elsevier Science B.V.

A note on the geometric unification of g

A note on the geometric unification of gravity and electromagnetism

✍ A. Coley 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 333 KB

A note on the complexity of program eval

A note on the complexity of program evaluation

✍ Oscar H. Ibarra; Brian S. Leininger; Louis E. Rosier 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 846 KB

On the parallel complexity of digraph re

On the parallel complexity of digraph reachability

✍ Samir Khuller; ; ; Uzi Vishkin; 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Note on reliability of a system complexi

Note on reliability of a system complexity

✍ T. Nakagawa; K. Yasui 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 419 KB

Most systems have been recently complicated with remarkable development of their high performances. Both hardware and softavare become redundant, and sometimes, serious problems of interference between them might be newly generated. It would be inappropriate to calculate the reliabilities of such co

A note on the complexity of finding regu

A note on the complexity of finding regular subgraphs

✍ J. Plesník 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 308 KB