Lower bounds on threshold and related circuits via communication complexity.
Vwani P. RoychowdhuryAlon OrlitskyKai-Yeung SiuPublished in: IEEE Trans. Inf. Theory (1994)
Keyphrases
- lower bound
- worst case
- upper bound
- high speed
- complexity measures
- computational cost
- branch and bound
- branch and bound algorithm
- objective function
- lower and upper bounds
- communication networks
- delay insensitive
- threshold selection
- logic circuits
- analog circuits
- memory efficient
- upper and lower bounds
- communication systems
- information sharing
- computational complexity