论文标题
证明，电路和沟通
Proofs, Circuits, and Communication
论文作者
论文摘要
我们调查了较低的结果，结果是通过命题证明复杂性，布尔电路复杂性和查询/通信复杂性之间的新发现的互连获得的复杂性理论。我们倡导总搜索问题理论（TFNP）作为这些联系的统一语言，并讨论了这种观点如何提出整个进一步研究的计划。
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.
