"The Equivalence of Horn and Network Complexity for Boolean Functions."

Stål O. Aanderaa, Egon Börger (1981)

> Home

Details and statistics

DOI: 10.1007/BF00289267

access: closed

type: Journal Article

metadata version: 2020-06-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/acta/AnderaaB81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/acta/AnderaaB81
Stål O. Aanderaa, Egon Börger:
The Equivalence of Horn and Network Complexity for Boolean Functions. Acta Informatica 15: 303-307 (1981)

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.