"A Lower Bound Technique for Nondeterministic Graph-Driven ..."

Beate Bollig, Philipp Woelfel (2005)

> Home

Details and statistics

DOI: 10.1007/S00224-004-1130-1

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/BolligW05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/BolligW05
Beate Bollig, Philipp Woelfel:
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. Theory Comput. Syst. 38(6): 671-685 (2005)

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.