Proofs, Circuits, and Communication
Computational Complexity
2022-02-21 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2202.08909,
title = {Proofs, Circuits, and Communication},
author = {Susanna F. de Rezende and Mika Göös and Robert Robere},
journal= {arXiv preprint arXiv:2202.08909},
year = {2022}
}