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

  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

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.

Other lists

EMBL-EBI Science and Society Programme Are there too may people? A head-to-head debate on overpopulation

Other talks

Single Cell Seminars (November) Metamaterials and the Science of Invisibility A passion for pottery: a photographer’s dream job Holonomic D-modules, b-functions, and coadmissibility Finding the past: Medieval Coin Finds at the Fitzwilliam Museum Animal Migration 70th Anniversary Celebration To be confirmed Knot Floer homology and algebraic methods Cambridge Rare Disease Summit 2017 St Catharine’s Political Economy Seminar - ‘Bank Credit Rating Changes, Capital Structure Adjustments and Lending’ by Claudia Girardone
 

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