Why are proof complexity lower bounds hard?
We formalize and study the question of whether there are inherent difficulties to showing lower bounds on propositional proof complexity. We establish the following unconditional result: Propositional proof systems cannot efficiently show that truth tables of random Boolean functions lack polynomial...
| Hlavní autoři: | , |
|---|---|
| Médium: | Conference item |
| Vydáno: |
Institute of Electrical and Electronics Engineers
2020
|