Periodic Reporting for period 2 - EPRICOT (Efficient Proofs and Computation: A Unified Algebraic Approach)

We address fundamental hardness problems in the theory of computing, relating to the runtime and size of certain computational models. These are notoriously hard open questions at the heart of computer science, the most famous of which is the P vs NP problem. Throughout the...