FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

Editors: Marc Vinyals, Olaf Beyersdorff and Jan Johannsen

Authors	Title	Paper	Talk
Azza Gaysin	Proof complexity of CSP		Jul 31 14:30
Emre Yolcu and Marijn Heule	Exponential separations using guarded extension variables		Aug 01 17:00
Hunter Monroe	Average-Case Hardness of Proving Tautologies and Theorems		Aug 01 14:00
Dmitry Itsykson and Artur Riazanov	Proof complexity of natural formulas via communication arguments		Jul 31 15:00
Nikita Gaevoy	Simulations between proof systems		Aug 01 14:30
Benjamin Böhm, Tomáš Peitl and Olaf Beyersdorff	QCDCL with Cube Learning or Pure Literal Elimination – What is best?		Aug 01 10:00
Ilario Bonacina, Nicola Galesi and Massimo Lauria	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (an extended abstract)		Aug 01 16:00
Tomáš Peitl and Stefan Szeider	Are Hitting Formulas Hard for Resolution?		Aug 01 15:00

Disclaimer | Powered by EasyChair Smart Program