Computational Learning Theory and BeyondKaren Seidel (PhD Student)
This video belongs to the openHPI course Computational Learning Theory and Beyond. Do you want to see more? Enroll yourself for free!

Excursus 10: Boolean Satisfiability (SAT)

Time effort: approx. 12 minutes
You are using our new video player. If you experience any problems, please contact the helpdesk. You can always switch to the old player.