Talks.cam will close on 1 July 2026, further information is available on the UIS Help Site
 

University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > NP search problems: Complexity and reducibilities

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

NP search problems: Complexity and reducibilities

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

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

Semantics and Syntax: A Legacy of Alan Turing

This is the first of two tutorial talks on total NP search problems. Full abstract not yet available.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Tarner Lectures Clark Lectures China Research Seminar Series

Other talks

'Honouring Giulio Regeni: a plea for research in risky environments' Internal Displacement in Cyprus and childhood: The view from genetic social psychology TODAY Foster Talk - Localised RNA-based mechanisms underlie neuronal wiring Surrogate models in Bayesian Inverse Problems Structurally unravelling ATP synthase What is the Market Potential of Multilingualism? "The integrated stress response – a double edged sword in skeletal development and disease" An SU(3) variant of instanton homology for webs Cambridge-Lausanne Workshop 2018 - Day 2 'Walking through Language – Building Memory Palaces in Virtual Reality' A rose by any other name Land of Eagles - Albania: from closed nation to wildlife paradise - where next?
 

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