From the article: As an example, the often-talked-about dependency management problem, is also NP-Complete and thus translates into SAT, and SAT could be trans

From the article: As an example, the often-talked-about dependency management problem, is also NP-Complete and thus translates into SAT, and SAT could be translated into dependency manager. The problem our group worked on, generating key and lock cuttings based on user-provided lock-chart and manufacturer-specified geometry, is also NP-complete.