Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In
Matthias KrauseStephan WaackPublished in: FOCS (1991)
Keyphrases
- lower bound
- logic circuits
- upper bound
- symmetric matrices
- positive definite
- branch and bound algorithm
- objective function
- communication systems
- information sharing
- branch and bound
- communication cost
- worst case
- digital circuits
- high speed
- depth map
- vc dimension
- lower and upper bounds
- np hard
- search space
- tunnel diode
- hurwitz radon