Abstract
The circuit complexity results for networks of perceptrons were studied. The complexity results for threshold logic circuits (TLC) were reviewed theoretically. Nine different constructive solutions for the addition of two binary numbers were also compared. It was found that all complexity results are asymptotic in nature.
| Original language | English |
|---|---|
| Pages | 989-994 |
| Number of pages | 6 |
| Publication status | Published - 2003 |
| Externally published | Yes |
| Event | International Joint Conference on Neural Networks 2003 - Portland, OR, United States Duration: Jul 20 2003 → Jul 24 2003 |
Other
| Other | International Joint Conference on Neural Networks 2003 |
|---|---|
| Country/Territory | United States |
| City | Portland, OR |
| Period | 7/20/03 → 7/24/03 |
Keywords
- Addition
- Neural/circuit complexity
- Perceptrons
ASJC Scopus subject areas
- Software
- Artificial Intelligence