{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T19:10:15Z","timestamp":1740856215426,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262084"},{"type":"electronic","value":"9783540321064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11494669_54","type":"book-chapter","created":{"date-parts":[[2011,1,13]],"date-time":"2011-01-13T14:48:09Z","timestamp":1294930089000},"page":"438-445","source":"Crossref","is-referenced-by-count":1,"title":["Using Kolmogorov Inspired Gates for Low Power Nanoelectronics"],"prefix":"10.1007","author":[{"given":"Valeriu","family":"Beiu","sequence":"first","affiliation":[]},{"given":"Artur","family":"Zawadski","sequence":"additional","affiliation":[]},{"given":"R\u0103zvan","family":"Andonie","sequence":"additional","affiliation":[]},{"given":"Snorre","family":"Aunet","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"54_CR1","first-page":"49","volume":"11","author":"E.I. Nechiporuk","year":"1964","unstructured":"Nechiporuk, E.I.: The synthesis of networks from threshold elements. Prob. Kiber.\u00a011, 49\u201362 (1964); Autom. Express 7 27\u201332, 35\u201339 (1964)","journal-title":"Prob. Kiber."},{"key":"54_CR2","first-page":"1288","volume":"202","author":"O.B. Lupanov","year":"1971","unstructured":"Lupanov, O.B.: On circuits of threshold elements. Dokl. Akad. Nauk SSSR\u00a0202, 1288\u20131291 (1971); Sov. Phys. Dokl. 17 91\u201393, (1972)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"54_CR3","volume-title":"Threshold Logic and Its Applications","author":"S. Muroga","year":"1971","unstructured":"Muroga, S.: Threshold Logic and Its Applications. John Wiley, New York (1971)"},{"key":"54_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/3-540-44989-2_89","volume-title":"Artificial Neural Networks and Neural Information Processing - ICANN\/ICONIP 2003","author":"V. Beiu","year":"2003","unstructured":"Beiu, V.: Constructive threshold logic addition: A synopsis of the last decade. In: Kaynak, O., Alpayd\u0131n, E., Oja, E., Xu, L. (eds.) ICANN 2003 and ICONIP 2003. LNCS, vol.\u00a02714, pp. 745\u2013752. Springer, Berlin (2003)"},{"key":"54_CR5","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1109\/TNN.2003.816365","volume":"14","author":"V. Beiu","year":"2003","unstructured":"Beiu, V., Quintana, J.M., Avedillo, M.J.: VLSI implementation of threshold logic: A comprehensive survey. IEEE Trans. Neural Networks\u00a014, 1217\u20131243 (2003)","journal-title":"IEEE Trans. Neural Networks"},{"key":"54_CR6","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/TEC.1961.5219204","volume":"10","author":"J. Myhill","year":"1961","unstructured":"Myhill, J., Kautz, W.H.: On the size of weights required for linear-input switching functions. IRE Trans. Electr. Comp.\u00a0EC-10, 288\u2013290 (1961)","journal-title":"IRE Trans. Electr. Comp."},{"key":"54_CR7","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/S0895480192235878","volume":"7","author":"J. H\u00e5stad","year":"1994","unstructured":"H\u00e5stad, J.: On the size of weights for threshold gates. SIAM J. Discr. Math.\u00a07, 484\u2013492 (1994)","journal-title":"SIAM J. Discr. Math."},{"key":"54_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1109\/PGEC.1966.264375","volume":"15","author":"D.R. Haring","year":"1966","unstructured":"Haring, D.R.: Multi-threshold threshold elements. IEEE Trans. Electr. Comp.\u00a0EC-15, 45\u201365 (1966)","journal-title":"IEEE Trans. Electr. Comp."},{"key":"54_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1109\/18.651031","volume":"44","author":"T.A. Diep","year":"1998","unstructured":"Diep, T.A.: Capacity of multilevel threshold devices. IEEE Trans. Inform. Th.\u00a044, 241\u2013255 (1998)","journal-title":"IEEE Trans. Inform. Th."},{"key":"54_CR10","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1109\/TC.1984.1676392","volume":"33","author":"S.L. Hurst","year":"1984","unstructured":"Hurst, S.L.: Multiple-valued logic: Its status and its future. IEEE Trans. Comp.\u00a033, 1160\u20131179 (1984)","journal-title":"IEEE Trans. Comp."},{"key":"54_CR11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/2.48","volume":"21","author":"K.C. Smith","year":"1988","unstructured":"Smith, K.C.: Multiple valued logic: A tutorial and appreciation. IEEE Comp.\u00a021, 17\u201327 (1988)","journal-title":"IEEE Comp."},{"key":"54_CR12","unstructured":"The International Technology Roadmap for Semiconductors (2004), http:\/\/public.itrs.net\/"},{"key":"54_CR13","doi-asserted-by":"crossref","unstructured":"Beiu, V., R\u00fcckert, U., Roy, S., Nyathi, J.: On nanoelectronic architectural challenges and solutions. Proc. IEEE Conf. Nanotech. Munich Germany, 628\u2013631 (2004)","DOI":"10.1109\/NANO.2004.1392441"},{"key":"#cr-split#-54_CR14.1","unstructured":"Hilbert, D.: Mathematische probleme. Nachr. Akad. Wiss. G??ttingen, 253???297 (1900);"},{"key":"#cr-split#-54_CR14.2","doi-asserted-by":"crossref","unstructured":"Bull. Amer. Math. Soc. 8, 437???479, (1902)","DOI":"10.1090\/S0002-9904-1902-00923-3"},{"key":"54_CR15","first-page":"179","volume":"108","author":"A.N. Kolmogorov","year":"1956","unstructured":"Kolmogorov, A.N.: On the representation of continuous functions of several variables by superposition of continuous functions of fewer variables. Dokl. Akad. Nauk SSSR\u00a0108, 179\u2013182 (1956); Amer. Math. Soc. Transl. 17, 369\u2013373, (1961)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"54_CR16","first-page":"679","volume":"114","author":"V.I. Arnol\u2019d","year":"1957","unstructured":"Arnol\u2019d, V.I.: On functions of three variables. Dokl. Akad. Nauk SSSR\u00a0114, 679\u2013681 (1957); Amer. Math. Soc. Transl. 28, 51\u201354, (1963)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"54_CR17","first-page":"953","volume":"114","author":"A.N. Kolmogorov","year":"1957","unstructured":"Kolmogorov, A.N.: On the representation of continuous functions of many variables by superpositions of continuous functions of one variable and addition. Dokl. Akad. Nauk SSSR\u00a0114, 953\u2013956 (1957); Amer. Math. Soc. Transl. 28, 55\u201359, (1963)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"54_CR18","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1090\/S0002-9947-1965-0210852-X","volume":"115","author":"D.A. Sprecher","year":"1965","unstructured":"Sprecher, D.A.: On the structure of continuous function of several variables. Trans. Amer. Math. Soc.\u00a0115, 340\u2013355 (1965)","journal-title":"Trans. Amer. Math. Soc."},{"key":"54_CR19","unstructured":"Lorenz, G.G.: Representation of functions of several variables by function of one variable. Chp. 11 in Approximations of Functions. Holt, Rinehart, and Winston, New York (1966)"},{"key":"54_CR20","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1090\/S0002-9939-1966-0194565-5","volume":"17","author":"D.A. Sprecher","year":"1966","unstructured":"Sprecher, D.A.: On the structure of representations of continuous functions of several variables as finite sums of continuous functions of one variable. Proc. Amer. Math. Soc.\u00a017, 98\u2013105 (1966)","journal-title":"Proc. Amer. Math. Soc."},{"key":"54_CR21","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1109\/TAC.1980.1102536","volume":"25","author":"R.J.P. Figueiredo de","year":"1980","unstructured":"de Figueiredo, R.J.P.: Implications and applications of Kolmogorov\u2019s superposition theorem. IEEE Trans. Autom. Control\u00a025, 1227\u20131231 (1980)","journal-title":"IEEE Trans. Autom. Control"},{"key":"54_CR22","first-page":"11","volume":"3","author":"R. Hecht-Nielsen","year":"1987","unstructured":"Hecht-Nielsen, R.: Kolmogorov\u2019s mapping neural network existence theorem. Proc. Intl. Conf. Neural Networks. San Diego CA\u00a03, 11\u201314 (1987)","journal-title":"Proc. Intl. Conf. Neural Networks. San Diego CA"},{"key":"54_CR23","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1162\/neco.1989.1.4.465","volume":"1","author":"F. Girosi","year":"1989","unstructured":"Girosi, F., Poggio, T.: Representation properties of networks: Kolmogorov\u2019s theorem is irrelevant. Neural Computation\u00a01, 465\u2013469 (1989)","journal-title":"Neural Computation"},{"key":"54_CR24","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1162\/neco.1991.3.4.617","volume":"3","author":"V. K\u016frkov\u00e1","year":"1991","unstructured":"K\u016frkov\u00e1, V.: Kolmogorov\u2019s theorem is relevant. Neural Computation\u00a03, 617\u2013622 (1991)","journal-title":"Neural Computation"},{"key":"54_CR25","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/0893-6080(92)90012-8","volume":"5","author":"V. K\u016frkov\u00e1","year":"1992","unstructured":"K\u016frkov\u00e1, V.: Kolmogorov\u2019s theorem and multilayer neural networks. Neural Networks\u00a05, 501\u2013506 (1992)","journal-title":"Neural Networks"},{"key":"54_CR26","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1162\/neco.1993.5.1.18","volume":"5","author":"J.N. Lin","year":"1993","unstructured":"Lin, J.N., Unbehauen, R.: On realization of a Kolmogorov network. Neural Computation\u00a05, 18\u201320 (1993)","journal-title":"Neural Computation"},{"key":"54_CR27","first-page":"183","volume":"3","author":"M. Nakamura","year":"1993","unstructured":"Nakamura, M., Mines, R., Kreinovich, V.: Guaranteed intervals and Kolmogorov\u2019s theoerem (and their possible relation to neural networks). Interval Computations\u00a03, 183\u2013199 (1993)","journal-title":"Interval Computations"},{"key":"54_CR28","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1016\/S0893-6080(09)80020-8","volume":"6","author":"D.A. Sprecher","year":"1993","unstructured":"Sprecher, D.A.: A universal mapping for Kolmogorov\u2019s superposition theorem. Neural Networks\u00a06, 1089\u20131094 (1993)","journal-title":"Neural Networks"},{"key":"54_CR29","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/0893-6080(94)90079-5","volume":"7","author":"H. Katsuura","year":"1994","unstructured":"Katsuura, H., Sprecher, D.A.: Computational aspects of Kolmogorov\u2019s superposition theorem. Neural Networks\u00a07, 455\u2013461 (1994)","journal-title":"Neural Networks"},{"key":"54_CR30","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0377-0427(94)90179-1","volume":"54","author":"M. Nees","year":"1994","unstructured":"Nees, M.: Approximative versions of Kolmogorov\u2019s superposition theorem, proved constructively. J. Comp. Appl. Math.\u00a054, 239\u2013250 (1994)","journal-title":"J. Comp. Appl. Math."},{"key":"54_CR31","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/0893-6080(95)00081-X","volume":"9","author":"D.A. Sprecher","year":"1996","unstructured":"Sprecher, D.A.: A numerical implementation of Kolmogorov\u2019s superpositions. Neural Networks\u00a09, 765\u2013772 (1996)","journal-title":"Neural Networks"},{"key":"54_CR32","first-page":"711","volume":"6","author":"D.A. Sprecher","year":"1996","unstructured":"Sprecher, D.A.: A numerical construction of a universal function for Kolmogorov\u2019s superpositions. Neural Network World\u00a06, 711\u2013718 (1996)","journal-title":"Neural Network World"},{"key":"54_CR33","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0893-6080(96)00073-1","volume":"10","author":"D.A. Sprecher","year":"1997","unstructured":"Sprecher, D.A.: A numerical implementation of Kolmogorov\u2019s superpositions II. Neural Networks\u00a010, 447\u2013457 (1997)","journal-title":"Neural Networks"},{"key":"54_CR34","unstructured":"Brattka, V.: A computable Kolmogorov superposition theorem. In: Blanck, J., Brattka, V., Hertling, P., Weihrauch, K. (eds.) Computability and Complexity in Analysis. Informatik Berichte, vol.\u00a0272, pp. 7\u201322. Informatik Berichte (2000)"},{"key":"54_CR35","unstructured":"Neruda, R., \u0160t\u011bdry, A., Drko\u0161ov\u00e1, J.: Towards feasible learning algorithm based on Kolmogorov theorem. Proc. Intl. Conf. AI. Las Vegas USA, 915\u2013920 (2000)"},{"key":"54_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/3-540-46084-5_77","volume-title":"Artificial Neural Networks - ICANN 2002","author":"M. K\u00f6ppen","year":"2002","unstructured":"K\u00f6ppen, M.: On the training of a kolmogorov network. In: Dorronsoro, J.R. (ed.) ICANN 2002. LNCS, vol.\u00a02415, pp. 474\u2013479. Springer, Heidelberg (2002)"},{"key":"54_CR37","unstructured":"Beiu, V.: Optimization of circuits using a constructive learning algorithm. In: Bulsari, A.B., Kallio, S. (eds.) Neural Networks in Engineering Systems, \u00c5bo Akademis Tryckeri, pp. 291\u2013294 (1997)"},{"key":"54_CR38","unstructured":"Beiu, V.: Neural inspired parallel computations require analog processors. Proc. Intl. Parallel Comp. and Electr. Eng. Conf. Bialystok Poland, 39\u201353 (1998)"},{"key":"54_CR39","doi-asserted-by":"crossref","unstructured":"Beiu, V.: On Kolmogorov\u2019s superposition and Boolean function. In: Proc. Brazilian Symp. Neural Networks, Belo Horizonte Brazil, pp. 55\u201360 (1998)","DOI":"10.1109\/SBRN.1998.730994"},{"key":"54_CR40","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1009665432594","volume":"8","author":"V. Beiu","year":"1998","unstructured":"Beiu, V., Makaruk, H.E.: Deeper sparser nets can be optimal. Neural Proc. Lett.\u00a08, 201\u2013210 (1998)","journal-title":"Neural Proc. Lett."},{"key":"54_CR41","doi-asserted-by":"publisher","first-page":"1601","DOI":"10.1162\/089976698300017052","volume":"10","author":"R. Sarpeshkar","year":"1998","unstructured":"Sarpeshkar, R.: Analog versus digital: Extrapolating from electronics to neurobiology. Neural Computation\u00a010, 1601\u20131638 (1998)","journal-title":"Neural Computation"},{"key":"54_CR42","doi-asserted-by":"publisher","first-page":"2003","DOI":"10.1162\/089976602320263971","volume":"14","author":"R. Sarpeshkar","year":"2002","unstructured":"Sarpeshkar, R., O\u2019Halloran, M.: Scalable hybrid computation with spikes. Neural Computations\u00a014, 2003\u20132038 (2002)","journal-title":"Neural Computations"},{"key":"54_CR43","doi-asserted-by":"crossref","unstructured":"Beiu, V.: A novel highly reliable low-power nano architecture: When von Neumann augments Kolmogorov. In: Proc. Appl.-specific Sys., Arch. and Proc., Galveston USA, pp. 167\u2013178 (2004)","DOI":"10.1109\/ASAP.2004.1342467"},{"key":"54_CR44","doi-asserted-by":"crossref","unstructured":"Avedillo, M.J., Quintana, J.M.: A threshold logic synthesis tool for RTD circuits. In: Proc. Euromicro Symp. Digital Sys. Design. Rennes, France, pp. 624\u2013627 (2004)","DOI":"10.1109\/DSD.2004.1333337"},{"key":"54_CR45","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/TCOMM.2004.840666","volume":"24","author":"R. Zhang","year":"2005","unstructured":"Zhang, R., Gupta, P., Zhong, L., Jha, N.K.: Threshold network synthesis and optimization and its application to nanotechnologies. IEEE Trans. CAD\u00a024, 107\u2013118 (2005)","journal-title":"IEEE Trans. CAD"}],"container-title":["Lecture Notes in Computer Science","Computational Intelligence and Bioinspired Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11494669_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T18:45:30Z","timestamp":1740854730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11494669_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262084","9783540321064"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/11494669_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}