|![[Search]](http://talks.cam.ac.uk/images/search.gif?1209136071)
|![[A-Z Index]](http://talks.cam.ac.uk/images/az.gif?1209136071)
|![[Contact]](http://talks.cam.ac.uk/images/contact.gif?1209136071)
||![[University of Cambridge]](http://talks.cam.ac.uk/images/identifier2.gif?1209136071){kind=small} |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![[Talks.cam]](http://talks.cam.ac.uk/images/talkslogosmall.gif?1209136071) |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > On Relaxations of Satisfiability
On Relaxations of SatisfiabilityAdd to your list(s) Download to your calendar using vCal
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 In this talk, I’ll report on recent results on two types of relaxations of satisfiability for combinatorial problems, namely satisfiability via operators for constraint satisfaction problems, and satisfiability with weaker constraints. A part of the talk is based on joint work with Andrei Bulatov (SFU). 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 listsScott Lectures Ignored Arab Christian Voices: Contextual Theology in the Era of Colonial Modernity Department of Public Health and Primary CareOther talksFormal Dinner at Christ's College Lecture 1 Free Afternoon Statistics Clinic Summer 2025 IV Grand Rounds Registration |
Standa Zivny (University of Oxford)
Thursday 24 July 2025, 11:00-12:00