Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In.
Matthias KrauseStephan WaackPublished in: Math. Syst. Theory (1995)
Keyphrases
- lower bound
- logic circuits
- upper bound
- symmetric matrices
- np hard
- positive definite
- branch and bound
- lower and upper bounds
- vc dimension
- communication systems
- depth information
- hurwitz radon
- communication networks
- information sharing
- communication cost
- branch and bound algorithm
- ranking functions
- singular value decomposition
- quadratic assignment problem
- analog circuits
- spiking neurons
- logic synthesis
- high speed
- positive semidefinite matrices
- worst case