✦ LIBER ✦

On the Size of Weights for Threshold Gates

✍ Scribed by Håstad, Johan

Book ID: 118198921
Publisher: Society for Industrial and Applied Mathematics
Year: 1994
Tongue: English
Weight: 932 KB
Volume: 7
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480192235878

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Algorithm for Simultaneous Gate Si

A New Algorithm for Simultaneous Gate Sizing and Threshold Voltage Assignment

✍ Yifang Liu; Jiang Hu 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 400 KB

Noise Threshold for Universality of Two-

Noise Threshold for Universality of Two-Input Gates

✍ Unger, F. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 208 KB

On the size of (generalized) OBDDs for t

On the size of (generalized) OBDDs for threshold functions

✍ Beate Bollig 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 154 KB

Coagulation and the total weight-fractio

Coagulation and the total weight-fraction over a threshold size

✍ John L Spouge; George I Bell 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 408 KB

nω(log n) lower bounds on the size of de

nω(log n) lower bounds on the size of depth-3 threshold cicuits with AND gates at the bottom

✍ Alexander Razborov; Avi Wigderson 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 338 KB

On the power of a threshold gate at the

On the power of a threshold gate at the top

✍ Mikael Goldmann 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 606 KB

The discriminator lemma is normally used to prove lower bounds for circuits with small-weight threshold gates. In this note we adapt the lemma to circuits with a general (large-weight) threshold gate at the top. The new lemma is used to give a new proof of a previously known lower bound for the size