youtube
This talk was recorded at NDC Toronto in Toronto, Canada. #ndctoronto #ndcconferences #developer #softwaredeveloper
Attend the next NDC conference near you:
Subscribe to our YouTube channel and learn every day:
/ @NDC
Follow our Social Media!
#programminglanguages
Many years ago, when I was an undergraduate CS student, my professor informed me that the Boolean Satisfiability problem was NP-Complete. I took this to mean it was not something I should waste any time thinking about or expect to be a useful tool in the future.
Then, many years later, I was attending a Meetup involving some live coding, and the presenter casually imported a SAT solver library, fed it some boolean variables and conditions, and out popped a solution! Then, several weeks later at a Rust meetup, a different presenter equally casually imported a CSP library, and used it to solve a challenging scheduling problem.
What happened? Was my professor wrong? Does NP=P now, and I missed it? This talk will cover the practical developments in this field since I was an undergraduate and demonstrate how to use it to solve my own problem: scheduling a pickleball tournament in the most competitive way, using a Rust CSP library.
|
2026/07/31
youtube
![Power BI Full Course 2026 [FREE] | Power BI Tutorial For Beginners | Power BI Training | Simplilearn](https://i.ytimg.com/vi/NjLEjUxOQP0/sddefault.jpg)
![AWS Solution Architect Full Course 2026 [FREE] | AWS Solution Architect Training 2026 | Simplilearn](https://i.ytimg.com/vi/l6s21SclmgE/sddefault.jpg)
