Proof complexity of natural formulas via communication arguments
Authors: Dmitry Itsykson and Artur Riazanov
Paper Information
| Title: | Proof complexity of natural formulas via communication arguments |
| Authors: | Dmitry Itsykson and Artur Riazanov |
| Proceedings: | PC 2022 Program papers |
| Editors: | Marc Vinyals, Olaf Beyersdorff and Jan Johannsen |
| Keywords: | bit pigeonhole principle, disjointness, multiparty communication complexity, perfect matching, proof complexity, randomized communication complexity, Resolution over linear equations, tree-like proofs |
| Pages: | 2 |
| Talk: | Jul 31 15:00 (Session 14K) |
| Paper: |  |