PC 2022 PROGRAM PAPERS: KEYWORD INDEX

A | |

automatizability of proof systems | |

Average-case complexity | |

B | |

bit pigeonhole principle | |

blocked clauses | |

Bounded arithmetic | |

C | |

CDCL | |

constraint satisfaction problems | |

D | |

disjointness | |

E | |

enumeration | |

extended resolution | |

H | |

hitting formulas | |

K | |

knapsack | |

L | |

lower bounds | |

M | |

multiparty communication complexity | |

N | |

Non-optimality of proof systems | |

O | |

optimal proof systems | |

P | |

perfect matching | |

polynomial calculus | |

proof complexity | |

propositional proof systems | |

Q | |

QBF | |

R | |

randomized communication complexity | |

resolution | |

resolution complexity | |

Resolution over linear equations | |

roots of unity | |

S | |

SAT encodings | |

separations | |

sum-of-squares | |

symmetries | |

T | |

tree-like proofs |