{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:46:33Z","timestamp":1754109993757,"version":"3.28.0"},"reference-count":95,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ijcnn.2003.1223825","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T14:34:28Z","timestamp":1079966068000},"page":"989-994","source":"Crossref","is-referenced-by-count":13,"title":["A survey of perceptron circuit complexity results"],"prefix":"10.1109","volume":"2","author":[{"given":"V.","family":"Beiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Fluidic threshold gate","year":"1972","author":"eckerlin","key":"ref73"},{"article-title":"Majority logic binary adder","year":"1969","author":"betts","key":"ref72"},{"key":"ref71","first-page":"107","article-title":"Asymptotic estimation of addition time of a parallel adder","volume":"19","author":"khrapchenko","year":"1967","journal-title":"Problemy Kibernetiki"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1675982"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/12.817389"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322232"},{"article-title":"Binary arithmetic circuits employing threshold gates in which both the sum and the carry are obtained in one gate delay interval","year":"1970","author":"winder","key":"ref74"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/18.312169"},{"article-title":"Threshold logic three-input adder","year":"1913","author":"heightley","key":"ref75"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF01137685"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/12.156534"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/12.53579"},{"key":"ref33","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1836.001.0001","author":"parberry","year":"1994","journal-title":"Circuit Complexity and Neural Networks"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89559"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1981.35"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28404"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54458-5_67"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.59"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/12.106225"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.312169"},{"article-title":"Neural Networks Using Threshold Gates: A Complexity Analysis of Their Area- and Time-Efficient VLSI Implementations","year":"1994","author":"beiu","key":"ref60"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480192235878"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(96)00130-X"},{"key":"ref63","first-page":"118","article-title":"On threshold circuits and polynomial computations","author":"rief","year":"1987","journal-title":"Proc CoCo'87"},{"key":"ref28","first-page":"619","article-title":"On ACC and threshold circuits","author":"yao","year":"1989","journal-title":"Proc FOCS'89"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480191218496"},{"key":"ref27","first-page":"40","article-title":"On the number of threshold functions","volume":"5","author":"irmatov","year":"1993","journal-title":"Diskretnaya Matematika"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1147\/rd.252.0156"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/5.58350"},{"key":"ref29","first-page":"6","article-title":"Almost optimal lower bounds for small depth circuits","volume":"5","author":"h\u00e5stad","year":"1986","journal-title":"Extended version in Adv Comp Res"},{"key":"ref67","first-page":"166","article-title":"Addition using constrained threshold gates","author":"beiu","year":"1994","journal-title":"Proceedings of CON'94"},{"key":"ref68","first-page":"227","article-title":"Low weight and fan-in neural networks for basic arithmetic operations","volume":"iv","author":"cotofana","year":"1997","journal-title":"Proceedings of IMACS'97"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1137\/0404038"},{"key":"ref2","first-page":"946","article-title":"?-entropy and the complexity of feedforward neural networks","author":"williamson","year":"1991","journal-title":"Adv Neural Inf Proc Sys (NIPS)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1201\/9781420050646"},{"key":"ref20","first-page":"49","article-title":"The synthesis of networks from threshold elements","volume":"11","author":"nechiporuk","year":"1964","journal-title":"Problemy Kibernetiki"},{"journal-title":"Threshold Logic and Its Application","year":"1971","author":"muroga","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1961.5219146"},{"key":"ref24","first-page":"6","article-title":"Synthesis of threshold circuits for certain classes of Boolean functions","volume":"5","author":"red'kin","year":"1970","journal-title":"Kibernetika"},{"key":"ref23","first-page":"1288","article-title":"On circuits of threshold elements","volume":"202","author":"lupanov","year":"1971","journal-title":"Dokl Akad Nuuk SSSR"},{"key":"ref26","first-page":"953","article-title":"On the circuit complexity of neural networks","author":"roychowdhury","year":"1991","journal-title":"Adv Neural Inf Proc Sys (NIPS)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1147\/rd.312.0235"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2696-4"},{"journal-title":"Discrete Neural Computation A Theoretical Foundation","year":"1994","author":"siu","key":"ref51"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0100486"},{"key":"ref94","first-page":"1349","article-title":"Optimal-depth circuits for prefix computation and addition","volume":"ii","author":"yeh","year":"2000","journal-title":"Proceedings of ASILOMAR-2000"},{"key":"ref93","first-page":"1331","article-title":"Optimal-depth threshold circuits for multiplication and related problems","volume":"ii","author":"yeh","year":"1999","journal-title":"Proc Asilomar 99"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/12.537130"},{"key":"ref91","first-page":"664","article-title":"Area-time performances of some neural computation","author":"beiu","year":"1994","journal-title":"Proceedings of SPRANN 94"},{"key":"ref90","first-page":"83","article-title":"Comparison and threshold gate decomposition","author":"beiu","year":"1993","journal-title":"Proc Microneuro '93"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167234"},{"key":"ref58","first-page":"584","article-title":"Placing feedforward neural networks among several circuit complexity classes","author":"beiu","year":"1994","journal-title":"Proc WCNN'94"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2097-1_121"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(05)80093-0"},{"key":"ref55","first-page":"23","article-title":"On the complexity of neural networks with sigmoid units","author":"siu","year":"1992","journal-title":"Proc NNSP-92"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185447"},{"journal-title":"The Complexity of Boolean Functions","year":"1987","author":"wegener","key":"ref53"},{"key":"ref52","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0141-9331(95)93087-Y","article-title":"Modeling the complexity of parallel and VLSI computations with Boolean circuits","volume":"19","author":"papadopoulos","year":"1995","journal-title":"Microprocess Microsyst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/5.573741"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2003.816365"},{"key":"ref40","article-title":"On the dynamic range of linear threshold elements","author":"siu","year":"1990","journal-title":"Res Rep RJ 7237"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/4.5949"},{"article-title":"Threshold gate circuits employing field-effect transistors","year":"1973","author":"lerch","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/4.475710"},{"article-title":"Fast static cascode logic gate","year":"1995","author":"lev","key":"ref15"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676445"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2002.803943"},{"key":"ref81","first-page":"418","article-title":"VLSI design of high-speed, low-area addition circuitry","author":"han","year":"1987","journal-title":"ICC'87 Proceedings"},{"article-title":"Feedback-induced pseudo-nMOS static (FIPNS) logic gate and method","year":"2002","author":"naffziger","key":"ref17"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/12.165399"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/92.894161"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/12.156535"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.1525\/9780520329560","author":"hu","year":"1965","journal-title":"Threshold Logic"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/12.2261"},{"key":"ref89","first-page":"9","article-title":"Regular area-efficient carry-lookahead adders","volume":"7","author":"ngai","year":"1985","journal-title":"Proc ARITH"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(94)00056-R"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-2312(97)00099-4"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(90)90001-T"},{"key":"ref5","first-page":"338","article-title":"The connectivity analysis of simple associations-or-How many connections do you need","author":"hammerstrom","year":"1988","journal-title":"Neural Info Proc Sys (NIPS'87"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1981.1585456"},{"article-title":"Adder and multiplier circuits employing logic gates having discrete, weighted inputs and methods of performing combinatorial operations there-with","year":"2001","author":"beiu","key":"ref8"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/12.214671"},{"article-title":"Neural network implementation of a binary adder","year":"1991","author":"jeong","key":"ref7"},{"key":"ref49","first-page":"944","article-title":"Neural computing with small weights","author":"siu","year":"1992","journal-title":"Adv Neural Inf Proc Sys (NIPS)"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1973.5009159"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1983.6158093"},{"article-title":"Adder having reduced number of internal layers and method of operation thereof","year":"2002","author":"beiu","key":"ref9"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/0403015"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1989.41816"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/0221003"},{"key":"ref47","article-title":"Depth efficient neural networks for division and related problems","author":"siu","year":"1991","journal-title":"Res Rep RJ 7946"},{"key":"ref42","first-page":"370","article-title":"Optimal depth neural networks for multiplication and related problems","author":"siu","year":"1991","journal-title":"Adv Neural Inf Proc Sys (NIPS)"},{"key":"ref41","first-page":"370","article-title":"Computing with almost optimal size threshold circuits","author":"siu","year":"1990","journal-title":"Tech Rep Info Sys Lab Stanford"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63538"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480192228619"}],"event":{"name":"2003 International Joint Conference on Neural Networks","acronym":"IJCNN-03","location":"Portland, OR, USA"},"container-title":["Proceedings of the International Joint Conference on Neural Networks, 2003."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8672\/27486\/01223825.pdf?arnumber=1223825","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T05:53:03Z","timestamp":1623736383000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1223825\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":95,"URL":"https:\/\/doi.org\/10.1109\/ijcnn.2003.1223825","relation":{},"subject":[]}}