Complexity theoretical results for randomized branching programs - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Martin Sauerhoff. Complexity theoretical results for randomized branching programs. PhD thesis, Technical University of Dortmund, Germany, 1999. [doi]

@phdthesis{dnb-15487,
  title = {Complexity theoretical results for randomized branching programs},
  author = {Martin Sauerhoff},
  year = {1999},
  url = {http://d-nb.info/955918863},
  researchr = {https://researchr.org/publication/dnb-15487},
  cites = {0},
  citedby = {0},
  school = {Technical University of Dortmund, Germany},
}

runs on WebDSL