University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > On Relaxations of Satisfiability

  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

On Relaxations of Satisfiability

Download to your calendar using vCal

  • UserStanda Zivny (University of Oxford)
  • ClockThursday 24 July 2025, 11:00-12: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

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 lists

Average on weekdays: 9202.63288288 kWh Herchel Smith Building Seminar Room Ground Floor, IPH Hybrid - Maxwell Centre & on Zoom

Other talks

Afternoon Break Title to be confirmed C2D3 Computational Biology Annual Symposium 2026 Online Causal Inference Seminar Dept of Zoology Inaugural lecture: 'Through the lens of a bee: from the past to the future' TOWARD AFFORDABLE PREVENTIVE HEALTHCARE: How basic science addresses grand challenges
 

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