Proof complexity of natural formulas via communication arguments (Q6115354)
From MaRDI portal
scientific article; zbMATH DE number 7711585
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proof complexity of natural formulas via communication arguments |
scientific article; zbMATH DE number 7711585 |
Statements
12 July 2023
0 references
bit pigeonhole principle
0 references
disjointness
0 references
multiparty communication complexity
0 references
perfect matching
0 references
proof complexity
0 references
randomized communication complexity
0 references
resolution over linear equations
0 references
tree-like proofs
0 references
Proof complexity of natural formulas via communication arguments (English)
0 references
