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
Eyal Solomon, CEO and co-founder of Lunar.dev, joins SE Radio’s Kanchan Shringi for a discussion on tooling for API consumption management...
Ines Montani, co-founder and CEO of Explosion, speaks with host Jeremy Jung about solving problems using natural language processing (NLP)...
Hyrum Wright, Senior Staff Engineer at Google, discusses the book he co-edited, “Software Engineering at Google,” with host Gregory M...
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 🙂