Elements of dynamic and 2-SAT programming : : paths, trees, and cuts / / Matthias Bentert.
This thesis presents faster (in terms of worst-case running times) exact algorithms for special cases of graph problems through dynamic programming and 2-SAT programming. Dynamic programming describes the procedure of breaking down a problem recursively into overlapping subproblems, that is, subprob...
Saved in:
Superior document: | Foundations of computing |
---|---|
VerfasserIn: | |
Place / Publishing House: | Berlin : : Universitätsverlag der Technischen Universität Berlin,, 2021. |
Year of Publication: | 2021 |
Language: | English |
Series: | Foundations of computing.
|
Physical Description: | 1 online resource (213 pages). |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Elements of dynamic and 2-SAT programming : : paths, trees, and cuts / / Matthias Bentert.
by: Bentert, Matthias,
Published: (2021.) -
Systems biology : simulation of dynamic network states / / Bernhard Palsson.
by: Palsson, Bernhard.
Published: (2011.) -
Elements of computational systems biology / edited by Huma M. Lodhi, Stephen H. Muggleton.
Published: (c2010.) -
Receptors P1 and P2 as Targets for Drug Therapy in Humans / / edited by Robson Faria.
Published: (2020.) -
Application of Calorimetry in Life Sciences : : Proceedings of the International Conference in Berlin, August 2–3, 1976 / / ed. by I. Lamprecht, B. Schaarschmidt.
Published: ([2019])