University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > SAT for the working mathematician

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

SAT for the working mathematician

Download to your calendar using vCal

  • UserGiles Gardam (University of Bonn)
  • ClockTuesday 22 July 2025, 16:10-17:00
  • HouseExternal.

If you have a question about this talk, please contact nobody.

OGGW05 - Geometric and combinatorial methods in the foundations of computer science and artificial intelligence

I will discuss solvers for the Boolean satisfiability problem (SAT) as a tool for the working mathematician. SAT is NP-complete which means it is (in theory) broadly applicable but (in theory) very difficult,  however modern SAT solvers are able to solve remarkably large problems in practice. An example of this from my own experience is producing a counterexample to the unit conjecture for group rings, which had remained open for 80 years. 

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Main Lecture Theatre, Old Divinity School, All Saints Passage, St John's College, Cambridge FW11, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Faculty of Education, Room GS3

Other talks

Group Work Seminars in Cancer TBC Title to be confirmed Title to be confirmed Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity