✦ LIBER ✦

On the circuit and VLSI complexity of threshold gate comparison

✍ Scribed by Valeriu Beiu

Book ID: 114296874
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 323 KB
Volume: 19
Category: Article
ISSN: 0925-2312
DOI: 10.1016/s0925-2312(97)00099-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Modelling the complexity of parallel and

Modelling the complexity of parallel and VLSI computations with Boolean circuits

✍ Constantinos V. Papadopoulos; Theodoros S. Andronikos 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 706 KB

Effect of the load capacity of threshold

Effect of the load capacity of threshold elements on the complexity of circuits

✍ N. P. Red'kin 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 149 KB

On the VLSI complexity of some arithmeti

On the VLSI complexity of some arithmetic and numerical problems

✍ B. Codenotti 📂 Article 📅 1987 🏛 Springer Milan 🌐 English ⚖ 833 KB

[IEEE 2011 IEEE Computer Society Annual

[IEEE 2011 IEEE Computer Society Annual Symposium on VLSI (ISVLSI) - Chennai, India (2011.07.4-2011.07.6)] 2011 IEEE Computer Society Annual Symposium on VLSI - Minimization of Circuit Delay and Power through Gate Sizing and Threshold Voltage Assignment

✍ Zhou, Shuzhe; Yao, Hailong; Zhou, Qiang; Cai, Yici 📂 Article 📅 2011 🏛 IEEE ⚖ 233 KB

[IEEE Comput. Soc. Press Sixth Great Lak

[IEEE Comput. Soc. Press Sixth Great Lakes Symposium on VLSI - Ames, IA, USA (22-23 March 1996)] Proceedings of the Sixth Great Lakes Symposium on VLSI - Delay hazards in complex gate based speed independent VLSI circuits

✍ Tabrizi, N.; Liebelt, M.J.; Eshraghian, K. 📂 Article 📅 1996 🏛 IEEE Comput. Soc. Press ⚖ 368 KB

[Lecture Notes in Computer Science] Math

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 2005 Volume 3618 || On the Complexity of Depth-2 Circuits with Threshold Gates

✍ Jȩdrzejowicz, Joanna; Szepietowski, Andrzej 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 225 KB

This Volume Contains The Papers Presented At The 30th Symposium On Mathematical Foundations Of Computer Science (mfcs 2005) Held In Gdansk, Poland From August 29th To September 2nd, 2005.