Periodic Reporting for period 3 - PCPABF (Challenging Computational Infeasibility: PCP and Boolean functions)

Our research into the mathematics of computation and, in particular, computational complexity theory, revolves around classifying computational problems as feasible or alternatively as infeasible, typically in the worst-case regime. A paradigm that transformed research in...