JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | ||
| dc.contributor.author | Rolinek, Michal | |
| dc.date.accessioned | 2020-04-01T14:46:50Z | |
| dc.date.available | 2020-04-01T14:46:50Z | |
| dc.date.issued | 2019 | |
| dc.identifier.issn | 1549-6333 | |
| dc.identifier.uri | http://hdl.handle.net/10900/99453 | |
| dc.language.iso | en | en |
| dc.publisher | Assoc Computing Machinery | de_DE |
| dc.relation.uri | http://dx.doi.org/10.1145/3230649 | |
| dc.subject.ddc | 004 | de_DE |
| dc.subject.ddc | 510 | de_DE |
| dc.title | Even Delta-Matroids and the Complexity of Planar Boolean CSPs | de_DE |
| dc.type | Article | de_DE |
| utue.quellen.id | 20190926111821_01545 | |
| utue.personen.roh | Kazda, Alexandr | |
| utue.personen.roh | Kolmogorov, Vladimir | |
| utue.personen.roh | Rolinek, Michal | |
| dcterms.isPartOf.ZSTitelID | Acm Transactions on Algorithms | de_DE |
| dcterms.isPartOf.ZS-Issue | Article 22 | de_DE |
| dcterms.isPartOf.ZS-Volume | 15 | de_DE |
| utue.fakultaet | Sonstige |
Dateien zu dieser Ressource
| Dateien | Größe | Format | Anzeige |
|---|---|---|---|
|
Zu diesem Dokument gibt es keine Dateien. |
|||