"An n^3/2 Lower Bound on the Monotone Network Complexity of the Boolean ..."

Jürgen Weiss (1983)

> Home

Details and statistics

DOI: 10.1016/S0019-9958(83)80035-7

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/Weiss83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/Weiss83
Jürgen Weiss:
An n^3/2 Lower Bound on the Monotone Network Complexity of the Boolean Convolution. Inf. Control. 59(1-3): 184-188 (1983)

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.