University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > NP search problems: Provability 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: Provability 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 second 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

CILR workshop: Pragmatics in interfaces Biological Chemistry Research Interest Group PMRFPS's

Other talks

EU LIFE Lecture - "Histone Chaperones Maintain Cell Fates and Antagonize Reprogramming in C. elegans and Human Cells" Britain, Jamaica and the modern global financial order, 1800-50 Lua: designing a language to be embeddable Localization and chiral splitting in scattering amplitudes The Exposome in Epidemiological Practice Coinage in the later medieval countryside: single-finds and the evidence from Rendlesham, Suffolk A polyfold lab report Dynamics of Phenotypic and Genomic Evolution in a Long-Term Experiment with E. coli 'Ways of Reading, Looking, and Imagining: Contemporary Fiction and Its Optics' Active bacterial suspensions: from individual effort to team work
 

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