"Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once ..."

Beate Bollig (2003)

> Home

Details and statistics

DOI: 10.1051/ITA:2003010

access: closed

type: Journal Article

metadata version: 2020-05-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ita/Bollig03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/Bollig03
Beate Bollig:
Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs. RAIRO Theor. Informatics Appl. 37(1): 51-66 (2003)

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.