-
because of the
Boolean satisfiability problem. Fertin, Jamshidi, and
Komusiewicz (2015)
strengthened this
result by
proving the
puzzle is NP-complete...
- pp. 495–517. van Bevern, René; Bredereck, Robert; Bulteau, Laurent;
Komusiewicz, Christian; Talmon, Nimrod; Woeginger,
Gerhard J. (2016). "Precedence-Constrained...
- Analysis",
Proceedings ISMB '00, 8: 307–316C, PMID 10977092 Huffner, F.;
Komusiewicz, C.; Liebtrau, A; Niedermeier, R (2014), "Partitioning
Biological Networks...
- NP-complete". arXiv:2003.08331 [cs.CC]. Fertin, Guillaume; Jamshidi, Shahrad;
Komusiewicz,
Christian (June 2015). "Towards an
Algorithmic Guide to
Spiral Galaxies"...
- German.
Brandenburgischer Künstlerverband im
Luisenforum - Staatssekretär
Komusiewicz eröffnet
erste Ausstellung am
neuen Ort. In German. Jürgen Weser: 13...
