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.
SE Radio 298: Moshe Vardi on P versus NP
Join the discussion
You must be logged in to post a comment.
3 comments
More from this show
Sriram Panyam, CTO at DagKnows, discusses SaaS Control Planes with SE Radio host Brijesh Ammanath. The discussion starts off with the...
Stevie Caldwell, Senior Engineering Technical Lead at Fairwinds, joins host Priyanka Raghavan to discuss zero-trust network reference...
Jim Bugwadia, CEO of Nirmata and a committer to the kyverno projects, joins host Robert Blumen for a discussion of policy-as-code and the...
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 🙂