"Complexity theoretical results for randomized branching programs."

Martin Sauerhoff (1999)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2021-07-17

- view
  - electronic edition @ shaker.de
  authority control:
- export record
  dblp key:
  - phd/dnb/Sauerhoff99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/dnb/Sauerhoff99
Martin Sauerhoff:
Complexity theoretical results for randomized branching programs. Technical University of Dortmund, Germany, Shaker 1999, ISBN 978-3-8265-4827-7, pp. 1-141

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.