DocumentCode :
3573569
Title :
A survey of perceptron circuit complexity results
Author :
Beiu, Valeriu
Author_Institution :
Sch. of EE&CS, Washington State Univ., Pullman, WA, USA
Volume :
2
fYear :
2003
Firstpage :
989
Abstract :
This paper surveys many circuit complexity results for networks of perceptrons, focusing on those presented over the last ten years. The first part reviews general theoretical results, while the second part is more practical, comparing nine different constructive solutions for the addition of two binary numbers.
Keywords :
circuit complexity; perceptrons; threshold logic; circuit complexity; neural networks; perceptron circuit; Complexity theory; Computer networks; Cost function; Logic circuits; Nerve fibers; Neural networks; Neurons; Optical computing; Tunneling; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 2003. Proceedings of the International Joint Conference on
ISSN :
1098-7576
Print_ISBN :
0-7803-7898-9
Type :
conf
DOI :
10.1109/IJCNN.2003.1223825
Filename :
1223825
Link To Document :
بازگشت