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

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.


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