Computational Complexity – Komplexitätstheorie
Author: | Domenic Cassisi, Thomas Hass |
---|---|
URN: | https://urn:nbn:de:bsz:fn1-opus4-87567 |
Parent Title (German): | informatikJournal |
Document Type: | Contribution to a Periodical |
Language: | German |
Year of Completion: | 2022 |
Release Date: | 2022/11/28 |
Tag: | Approximationsalgorithmen; Average-Case; Komplexitätstheorie; Laufzeitkomplexität; P-NP-Problem |
Volume: | 13.2022 |
First Page: | 3 |
Last Page: | 12 |
Open-Access-Status: | Open Access |
informatikJournal: | informatikJournal 2023 |
Licence (German): | ![]() |