Please use this identifier to cite or link to this item:
http://dx.doi.org/10.25673/5041Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.referee | Bräsel, Heidemarie | - |
| dc.contributor.author | Andresen, Michael | - |
| dc.date.accessioned | 2018-09-24T17:04:15Z | - |
| dc.date.available | 2018-09-24T17:04:15Z | - |
| dc.date.issued | 2009 | - |
| dc.identifier.uri | https://opendata.uni-halle.de//handle/1981185920/11132 | - |
| dc.identifier.uri | http://dx.doi.org/10.25673/5041 | - |
| dc.description.statementofresponsibility | von Michael Andresen | - |
| dc.format.extent | Online-Ressource (PDF-Datei: 194 S., 2578 KB) | - |
| dc.language.iso | ger | - |
| dc.publisher | Universitätsbibliothek | - |
| dc.publisher | Otto von Guericke University Library, Magdeburg, Germany | - |
| dc.subject | Graphentheorie | - |
| dc.subject | Reduzierbarkeit | - |
| dc.subject.ddc | 511 | - |
| dc.title | Zur Komplexität von Reduzierbarkeitsproblemen über H-Comparabilitygraphen | - |
| dcterms.type | Hochschulschrift | - |
| dc.type | PhDThesis | - |
| dc.identifier.urn | urn:nbn:de:101:1-201012104588 | - |
| local.publisher.universityOrInstitution | Otto-von-Guericke-Universität Magdeburg | - |
| local.openaccess | true | - |
| Appears in Collections: | Fakultät für Mathematik | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Dissertation_(Michael_Andresen).PDF | 2.58 MB | Adobe PDF |  View/Open |