✦ LIBER ✦

An optimal deciphering algorithm for some classes of monotonic functions

✍ Scribed by A.V. Serzhantov

Publisher: Elsevier Science
Year: 1983
Weight: 291 KB
Volume: 23
Category: Article
ISSN: 0041-5553
DOI: 10.1016/s0041-5553(83)80025-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Deciphering of some classes of monotonic

Deciphering of some classes of monotonic many-valued functions

✍ V.B. Alekseev 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 738 KB

Optimization of Active Algorithms for Re

Optimization of Active Algorithms for Recovery of Monotonic Functions from Hölder′s Class

✍ Nikolaj P. Korneichuk 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 165 KB

A branch-and-bound algorithm to obtain a

A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions

✍ Yu. Breitbart; A. Reiter 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 394 KB

An optimal algorithm for finding all the

An optimal algorithm for finding all the jumps of a monotone step-function

✍ Refael Hassin; Nimrod Megiddo 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 377 KB

On one criterion of the optihality of an

On one criterion of the optihality of an algorithm for evaluating monotonic boolean functions

✍ D.N. Gainanov 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 599 KB

An Efficient Parallel Algorithm for Maxi

An Efficient Parallel Algorithm for Maximum Matching for Some Classes of Graphs

✍ I. Parfenoff 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 403 KB

The P 4 -tidy graphs were introduced by I. Rusu to generalize some already known classes of graphs with few induced P 4 (cographs, P 4 -sparse graphs, P 4 -lite graphs). Here, we propose an extension of R. Lin and S. Olariu's work (1994. J. Parallel Distributed Computing 22, 26 36.) on cographs, usi