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
Tags: P versus NP, SAT solving, satisfiability
This was a great episode. I hope for more about computer science!
I like this episode. Let’s have more applied computer science into SE radio. Good job Felienne to make scientists talk this way!
This was a suprisingly great episode on theoretical computer science.
Very non trivial problems are explained quite handy to anybody 🙂