University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Quantitative geometry and efficient classification procedures

  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

Quantitative geometry and efficient classification procedures

Download to your calendar using vCal

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

Institute distinguished event

This talk will illustrate to non-experts the use of geometric methods to design efficient partitioning algorithms for discrete objects or, in some cases, to prove that such algorithms must fail to perform well. These connections show that combinatorial optimization problems are intimately related to classical questions in continuous geometry, and we will describe some recent progress on old questions that translates to the best known results on algorithmic problems of central interest. This talk will provide an introduction to geometric aspects of computational complexity via an examination of specific examples. No specialized background will be required.

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

Senior Combination Room (SCR), St Catharine’s College, Trumpington Street Cynthia Beerbower Room, Newnham College Board Rooms, Addenbrooke's Hospital (Main Entrance), Hills Road, Cambridge, CB2 0QQ

Other talks

Title to be confirmed A Data-Centric Approach to AI Adaptation and Alignment Group Work The search for a new population of strong gravitational lenses with JWST Title to be confirmed Title and abstract tba
 

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