Proofs, Circuits, and Communication

02/17/2022
by   Susanna F. de Rezende, et al.
0

We survey lower-bound results in complexity theory that have been obtained via newfound interconnections between propositional proof complexity, boolean circuit complexity, and query/communication complexity. We advocate for the theory of total search problems (TFNP) as a unifying language for these connections and discuss how this perspective suggests a whole programme for further research.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset