✦ LIBER ✦

A method of constructing fast algorithms in the k-valued logic

✍ Scribed by V. B. Alekseev; N. R. Emel'yanov

Publisher: SP MAIK Nauka/Interperiodica
Year: 1985
Tongue: English
Weight: 472 KB
Volume: 38
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01137475

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A series of precomplete classes in k-val

A series of precomplete classes in k-valued logic

✍ R. A. Batramov 📂 Article 📅 1969 🏛 Springer US 🌐 English ⚖ 206 KB

A Local algorithm of index 1 for constru

A Local algorithm of index 1 for constructing the sum of dead-end disjunctive normal forms for functions of k-valued logic

✍ A.N. Nurlybaev 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 635 KB

The complexity of dynamic tests for func

The complexity of dynamic tests for functions of k-valued logic

✍ V. A. Vardanyan 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 753 KB

Search for a maximum upper zero for a cl

Search for a maximum upper zero for a class of monotonic functions in k-valued logic

✍ N.N. Katerinochkina 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 645 KB

The Fast Construction of Extension Veloc

The Fast Construction of Extension Velocities in Level Set Methods

✍ D Adalsteinsson; J.A Sethian 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 398 KB

Level set techniques are numerical techniques for tracking the evolution of interfaces. They rely on two central embeddings; first, the embedding of the interface as the zero level set of a higher dimensional function, and second, the embedding (or extension) of the interface's velocity to this high

A general method of constructing regular

A general method of constructing regularizing algorithms for a linear ill-posed equation in Hilbert space

✍ A.B. Bakushinskii 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 428 KB