✦ LIBER ✦

An iterative algorithm for testing two-asummability of boolean functions

✍ Scribed by Pal, A.

Book ID: 119813694
Publisher: IEEE
Year: 1981
Tongue: English
Weight: 348 KB
Volume: 69
Category: Article
ISSN: 0018-9219
DOI: 10.1109/proc.1981.12139

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Algorithm for Testing Asummability of

An Algorithm for Testing Asummability of Boolean Functions

✍ Sureshchander 📂 Article 📅 1974 🏛 IEEE 🌐 English ⚖ 684 KB

An algorithm for the synthesis of two-di

An algorithm for the synthesis of two-dimensional iterative systems

✍ O. M. Revin 📂 Article 📅 1979 🏛 Springer US 🌐 English ⚖ 294 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 iterative algorithm for solving a kin

An iterative algorithm for solving a kind of discrete HJB equation with -functions

✍ Hongru Xu; Zhe Sun; Shuilian Xie 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 204 KB

An algorithm for optimum common root fun

An algorithm for optimum common root functions of two digraphs

✍ Mao-cheng Cai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 427 KB

An algorithm for optimum common root functions of two digraphs, Discrete -i? Mathematics 119 (1993) 13-20. ,%I, Let G1 and G, be finite digr,phs, both with vertex set V. Suppose that each c of V has nonnegative integers f(a) and g(u) with,'f(o)<g( ). v and each arc e of G, has nonnegative integers a

An O(nm)-time algorithm for computing th

An O(nm)-time algorithm for computing the dual of a regular Boolean function

✍ Uri N. Peled; Bruno Simeone 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 924 KB