✦ LIBER ✦

Methods of Decreasing the Complexity of Logic Circuits

✍ Scribed by O.N. Muzychenko

Book ID: 111527656
Publisher: SP MAIK Nauka/Interperiodica
Year: 2001
Tongue: English
Weight: 251 KB
Volume: 62
Category: Article
ISSN: 0005-1179
DOI: 10.1023/a:1002844320716

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity and synthesis of minimal logi

Complexity and synthesis of minimal logic circuits using multiplexers

✍ V. I. Lazarev 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 199 KB

Low Complexity Out-of-Order Issue Logic

Low Complexity Out-of-Order Issue Logic Using Static Circuits

✍ Mhambrey, Siddhesh S.; Maurya, Satendra K.; Clark, Lawrence T. 📂 Article 📅 2013 🏛 IEEE 🌐 English ⚖ 971 KB

Decreasing the complexity of LDPC iterat

Decreasing the complexity of LDPC iterative decoders

✍ Bosco, G.; Montorsi, G.; Benedetto, S. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 213 KB

Complexity analysis of the cost-table ap

Complexity analysis of the cost-table approach to the design of multiple-valued logic circuits

✍ Schueller, K.A.; Butler, J.T. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 127 KB

Checking Combinational Circuits by the M

Checking Combinational Circuits by the Method of Logic Complement

✍ M. Goessel; A. V. Morozov; V. V. Sapozhnikov; Vl. V. Sapozhnikov 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 280 KB

The complexity of revising logic program

The complexity of revising logic programs

✍ Russell Greiner 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 237 KB

A rule-based program will return a set of answers to each query. An impure program, which includes the Prolog ut ``!'' and ``not@ÁA'' operators, can return dierent answers if its rules are re-ordered. There are also many reasoning systems that return only the ®rst answer found for each query; these