Skip to content

SAS

Seminar

NP search problems: Complexity and reducibilities

Buss, S (University of California, San Diego)
Wednesday 28 March 2012, 11:30-12:30

Seminar Room 1, Newton Institute

Abstract

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

Presentation

[pdf ]

Video

The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.

Back to top ∧