"A 2.5n Lower Bound on the Monotone Network Complexity of T_3^n."

Paul E. S. Dunne (1985)

> Home

Details and statistics

DOI: 10.1007/BF00264232

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/acta/Dunne85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/acta/Dunne85
Paul E. S. Dunne:
A 2.5n Lower Bound on the Monotone Network Complexity of T_3^n. Acta Informatica 22(2): 229-240 (1985)

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.