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: Boolean Satisfiability

Speaker: Anthony Zaleski, Rutgers University

Date: Thursday, November 2, 2017 5:00pm

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


Given a logical formula in n Boolean variables, how can we determine whether there is an assignment to the variables that makes it true? This is the task of Boolean satisfiability (SAT), the first problem proved to be NP-complete. Here, we shall talk about our ideas for constructing SAT solvers. Then, we shall discuss some computer-generated results and conjectures regarding generalizations of SAT inspired by integer covering systems.

Joint work with Dr. Zeilberger.

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