Tag: satisfiability

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

Filed in Episodes by on July 25, 2017 1 Comment
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 […]

Continue Reading »