A Survey of Perception Circuit Complexity Results

Valeriu Beiu

Research output: Contribution to conferencePaperpeer-review

14 Citations (Scopus)

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 languageEnglish
Pages989-994
Number of pages6
Publication statusPublished - 2003
Externally publishedYes
EventInternational Joint Conference on Neural Networks 2003 - Portland, OR, United States
Duration: Jul 20 2003Jul 24 2003

Other

OtherInternational Joint Conference on Neural Networks 2003
Country/TerritoryUnited States
CityPortland, OR
Period7/20/037/24/03

Keywords

  • Addition
  • Neural/circuit complexity
  • Perceptrons

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'A Survey of Perception Circuit Complexity Results'. Together they form a unique fingerprint.

Cite this