"An Explicit Lower Bound of 5n - o(n) for Boolean Circuits."

Kazuo Iwama, Hiroki Morizumi (2002)

> Home

Details and statistics

DOI: 10.1007/3-540-45687-2_29

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mfcs/IwamaM02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/IwamaM02
Kazuo Iwama, Hiroki Morizumi:
An Explicit Lower Bound of 5n - o(n) for Boolean Circuits. MFCS 2002: 353-364

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.