Neural networks usually work adequately on small problems but can run into trouble when they are scaled up to problems involving large amounts of input data. Circuit Complexity and Neural Networks addresses the important question of how well neural networks scale - that is, how fast the computation time and number of neurons grow as the problem size increases. It surveys recent research in circ…
Communication Complexity describes a new intuitive model for studying circuit networks that captures the essence of circuit depth. Although the complexity of boolean functions has been studied for almost 4 decades, the main problems the inability to show a separation of any two classes, or to obtain nontrivial lower bounds remain unsolved. The communication complexity approach provides clues as…
"MIT Press."An exploration of the techniques for analyzing the behavior of one- and two-dimensional iterative networks formed of discrete, or logical elements, showing that most questions about the behavior of iterative systems are recursively undecidable.Title from vendor webpage (IEEE Xplore; viewed on Feb. 14, 2013).An exploration of the techniques for analyzing the behavior of one- and two-…