"Zur Komplexität von Reduzierbarkeitsproblemen über ..."

Michael Andresen (2009)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2021-07-17

- view
  - electronic edition @ uni-halle.de
  - electronic edition @ nbn-resolving.org
  authority control:
- export record
  dblp key:
  - phd/dnb/Andresen09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/dnb/Andresen09
Michael Andresen:
Zur Komplexität von Reduzierbarkeitsproblemen über H-Comparabilitygraphen. Otto-von-Guericke University Magdeburg, Germany, 2009

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.