SE-Radio Episode 298: Moshe Vardi on P versus NP

Felienne talks with Moshe Vardi about P versus NP. Why is this problem so central to computer science? Are we close to solving it?  Is it necessary to solve it? Progress toward computing hard problems efficiently with SAT solvers.  How SAT solvers work,; applications of SAT like formal verification.

Related Links

• TU Eindhoven P versus NP page
• SAT solving benchmark
• Z3 solver
• Minisat (an open source solver)
• Info on the SAT competitions
• Moshe on Twitter
• Moshe on Wikipedia

Podcast: Play in new window | Download

Subscribe: Apple Podcasts | RSS