Sponsored by the Rutgers University Department of Mathematics and the
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)

Doron Zeilberger, Rutgers University, zeilberg {at} math [dot] rutgers [dot] edu
Bryan Ek, Rutgers University, bryan [dot] t [dot] ek {at} math [dot] rutgers [dot] edu

Title: CNF-DNF and All That

Speaker: Doron Zeilberger, Rutgers University

Date: Thursday, September 28, 2017 5:00pm

Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ


The acronyms CNF and DNF feature prominently in Norbert Blum's brave attempt at proving the most important open problem of our time (with the possible exception of the much more intractable problem of establishing world peace). But there are many other aspects of CNFs, and their duals, DNFs, worth pursuing for their own sake. These other problems won't earn you a million dollars, but they are even more fun.

Joint work with Anthony Zaleski.

See: http://sites.math.rutgers.edu/~bte14/expmath/