Most CSPs should have OGPs - A tale of failuresSpeaker: Juspreet
Title: Most CSPs should have OGPs - A tale of failures
Date: 15 Oct 2021 11:45-13:00 EST
Location: SEC Level 3 NW Terrace
Abstract: We will informally talk about constraint satisfaction problems and the desire to understand their average-case complexity. A natural connection with statistical physics will emerge. I’ll then talk about a property that I think a large number of CSPs should have, but I don’t even know where to begin to try to show that this is the case. We’ll then laugh (and maybe ponder) at the failure of each attempt so far. The talk is completely informal, and absolutely no prerequisite knowledge is required or assumed.