A survey of perceptron circuit complexity results
Valeriu C. Beiu · 2004
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.