Guest Column-Reference-Cited by-同舟云学术

Guest Column

Published:2022-04-18 Issue:1 Volume:53 Page:59-82
ISSN:0163-5700
Container-title:ACM SIGACT News
language:en
Short-container-title:SIGACT News

Author:

de Rezende S.F.¹,Göös M.²,Robere R.³

Affiliation:

1. Lund University, Lund, Sweden

2. EPFL, Lausanne, Switzerland

3. McGill University, Montreal, PQ, Canada

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.

Publisher

Association for Computing Machinery (ACM)

Subject

General Materials Science

Link

https://dl.acm.org/doi/pdf/10.1145/3532737.3532746

Reference75 articles.

1. The monotone circuit complexity of boolean functions

2. A combinatorial characterization of resolution width

3. Mutilated chessboard problem is exponentially hard for resolution

4. The Relative Complexity of NP Search Problems

5. SIAM Jour- nal on Computing, 30(5):1462{1484;Bonet Maria Luisa,2000

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Random (log )-CNF Are Hard for Cutting Planes (Again);Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Size and Depth of Monotone Neural Networks: Interpolation and Approximation;IEEE Transactions on Neural Networks and Learning Systems;2024

4. Catalytic Branching Programs from Groups and General Protocols;ACM Transactions on Computation Theory;2023-12-12

5. On Protocols for Monotone Feasible Interpolation;ACM Transactions on Computation Theory;2023-03-31