"An Omega(n^4/3) Lower Bound on the Monotone Network Complexity of n-th ..."

Norbert Blum (1981)

> Home

Details and statistics

DOI: 10.1109/SFCS.1981.10

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

- view
  authority control:
- export record
  dblp key:
  - conf/focs/Blum81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/Blum81
Norbert Blum:
An Omega(n^4/3) Lower Bound on the Monotone Network Complexity of n-th Degree Convolution. FOCS 1981: 101-108

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.