University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Valiants Shift problem: A reduction to a problem about graph guessing games

Valiants Shift problem: A reduction to a problem about graph guessing games

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

The talk will survey a number of results that were partly developed during my visit at the Newton Institute. I will show that Valiant’s Shift problem/conjecture – which has been open for more than 30 years – naturally reduce to questions about guessing games. In the talk I will also provide a new perspective on information bottlenecks in Boolean Circuits/Communication Networks.

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-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity