"Upper and Lower Bounds for Certain Graph-Accessability-Problems on Bounded ..."

Christoph Meinel, Stephan Waack (1992)

> Home

Details and statistics

DOI: —

access: unavailable

type: Informal or Other Publication

metadata version: 2017-06-08

- no documents available
- export record
  dblp key:
  - tr/trier/MI92-04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/tr/trier/MI92-04
Christoph Meinel, Stephan Waack:
Upper and Lower Bounds for Certain Graph-Accessability-Problems on Bounded Alternating (omega)-Branching Programs. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-04 (1992)

a service of

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.