"Size-time complexity of Boolean networks for prefix computations."

Gianfranco Bilardi, Franco P. Preparata (1989)

> Home

Details and statistics

DOI: 10.1145/62044.62052

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/BilardiP89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/BilardiP89
Gianfranco Bilardi, Franco P. Preparata:
Size-time complexity of Boolean networks for prefix computations. J. ACM 36(2): 362-382 (1989)

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.