Computational Mathematics: P=NP for students and engineers at Nova Labs

June 4 @ 7:00 pm - 9:00 pm EDT

This meetup session, we intend to cover an example expression that, when any of certain assumption orderings is chosen, has a hyper-polynomial cost for DPLL, CDCL, and an algorithm that simply identifies teardrops, but does not have a hyper-polynomial cost for the Rain of Strepsiades regardless of assumption order.Questions related to earlier lectures will also be entertained.