MIT 6.890 Algorithmic Lower Bounds, Fall 2014 - 5. SAT Reductions

5.0 (3)

29 learners

What you'll learn

This course includes

31 hours of video
Certificate of completion
Access on mobile and TV

Summary

Keywords

Nintendo Mario Conway's Phutball cryptarithms alphametics vertex-disjoint paths glitches Zelda Metroid Donkey Kong Pokemon

Full Transcript

MIT 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs, Fall 2014 View the complete course: http://ocw.mit.edu/6-890F14 Instructor: Erik Demaine In this lecture, Professor Demaine explains hardness proofs of games and puzzles, and graph theoretic problems, all reducing from 3-SAT. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Welcome