SAT for the working mathematician

Add to your list(s) Download to your calendar using vCal

• Giles Gardam (University of Bonn)
• Tuesday 22 July 2025, 16:10-17:00
• External.

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:

• All CMS events
• External
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.