Sciweavers

COCO
1997
Springer
144views Algorithms» more  COCO 1997»
13 years 11 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan