Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 tr/trier/MI92-04
%A Meinel, Christoph
%A Waack, Stephan
%D 1992
%J Universität Trier, Mathematik/Informatik, Forschungsbericht
%K dblp
%T Upper and Lower Bounds for Certain Graph-Accessability-Problems on Bounded Alternating (omega)-Branching Programs
%V 92-04
@article{tr/trier/MI92-04,
added-at = {2011-12-29T00:00:00.000+0100},
author = {Meinel, Christoph and Waack, Stephan},
biburl = {https://www.bibsonomy.org/bibtex/20f5abd178f1f785b4b648e7e4e2fa289/dblp},
interhash = {326c240c03ad8d8f56266e0f60e56d65},
intrahash = {0f5abd178f1f785b4b648e7e4e2fa289},
journal = {Universität Trier, Mathematik/Informatik, Forschungsbericht},
keywords = {dblp},
timestamp = {2011-12-30T11:32:40.000+0100},
title = {Upper and Lower Bounds for Certain Graph-Accessability-Problems on Bounded Alternating (omega)-Branching Programs},
volume = {92-04},
year = 1992
}