"A 4n-Lower Bound on the Monotone Network Complexity of a One-Output ..."

Jürgen Tiekenheinrich (1984)

> Home

Details and statistics

DOI: 10.1016/0020-0190(84)90111-X

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Tiekenheinrich84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Tiekenheinrich84
Jürgen Tiekenheinrich:
A 4n-Lower Bound on the Monotone Network Complexity of a One-Output Boolean Function. Inf. Process. Lett. 18(4): 201-202 (1984)

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.