2 ms·
Dependency resolution with versions is indeed NP-hard, if versions "conflict" (2 versions of the same package can't be installed at the same time). What if they
by akoboldfrying 2y ago
Dependency resolution with versions is indeed NP-hard, if versions "conflict" (2 versions of the same package can't be installed at the same time). What if they don't conflict, and you just wanna install the fewest possible package versions to satisfy all dependencies? That's NP-hard too.
- amelius 2y agoI suppose you could use a generic SAT solver for that. EDIT: https://hal.science/hal-00870846/file/W5_PX_Le_Berre_On_SAT_technologies_for_dependency_management_and_beyond.pdf https://hal.science/hal-00870846/file/W5_PX_Le_Berre_On_SAT_...