An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity.
Kei UchizawaEiji TakimotoPublished in: Computational Complexity Conference (2007)
Keyphrases
- lower bound
- average case complexity
- exponential size
- worst case
- upper bound
- space complexity
- constant factor
- small size
- computational complexity
- polynomial size
- energy consumption
- objective function
- branch and bound algorithm
- alphabet size
- average case
- optimal solution
- fixed size
- small number
- branch and bound
- decision problems
- depth map
- small sized
- memory requirements
- linear complexity
- np hard
- depth information
- worst case time complexity
- search space
- delay insensitive
- threshold selection
- high speed
- online learning
- lower bounding
- circuit design
- window size
- sample complexity