University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Randomised algorithms for the maximum clique problem

  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

Randomised algorithms for the maximum clique problem

Download to your calendar using vCal

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

Combinatorics and Statistical Mechanics

Abstract not available

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

Let count in Cambridge University Engineering Department, Lecture Theatre 4 Teams Meeting ID: 316 477 688 057 9 Passcode: cT3Gf6Sh

Other talks

Understanding the Interplay between LLMs' Utilisation of Parametric and Contextual Knowledge An Amphibious Urbanism | | Cut 4: The Desert Arrives Slowly Title to be confirmed When Programmes Disagree About Programmes: Code Poetry and the Problem of Programme–Programme Communication Quantum optics with organic molecules The uplift and erosion history of the Gamburtsev Subglacial Mountains and their role in the formation of the East Antarctic Ice Sheet
 

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