"On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times ..."

Beate Bollig, Martin Sauerhoff, Ingo Wegener (2002)

> Home

Details and statistics

DOI: 10.1006/INCO.2002.3174

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/BolligSW02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/BolligSW02
Beate Bollig, Martin Sauerhoff, Ingo Wegener:
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. Inf. Comput. 178(1): 263-278 (2002)

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.