๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on parallel complexity of maximum f-matching

โœ Scribed by Anders Dessmark; Oscar Garrido; Andrzej Lingas


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
306 KB
Volume
65
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

โœฆ Synopsis


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


๐Ÿ“œ SIMILAR VOLUMES


Note on reliability of a system complexi
โœ 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