default search action

combined dblp search
author search
venue search
publication search

ask others

"Lower bounds for the complexity of reliable Boolean circuits with noisy gates."

Péter Gács, Anna Gál (1994)

> Home

Details and statistics

DOI: 10.1109/18.312190

access: closed

type: Journal Article

metadata version: 2020-03-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tit/GacsG94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/GacsG94
Péter Gács, Anna Gál:
Lower bounds for the complexity of reliable Boolean circuits with noisy gates. IEEE Trans. Inf. Theory 40(2): 579-583 (1994)

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.