An Omega(n-4/3) Lower Bound on the Monotone Network Complexity of the n-th Degree Convolution

Norbert Blum. An Omega(n-4/3) Lower Bound on the Monotone Network Complexity of the n-th Degree Convolution. Theoretical Computer Science, 36:59-69, 1985.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.