"Monotone Circuits for Connectivity Have Depth (log ..."

Mikael Goldmann, Johan Håstad (1998)

> Home

Details and statistics

DOI: 10.1137/S0097539795285631

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/GoldmannH98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/GoldmannH98
Mikael Goldmann, Johan Håstad:
Monotone Circuits for Connectivity Have Depth (log n)^2-o(1). SIAM J. Comput. 27(5): 1283-1294 (1998)

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.