FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

B
Beyersdorff, Olaf	QCDCL with Cube Learning or Pure Literal Elimination – What is best? (, talk)
Bonacina, Ilario	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (an extended abstract) (, talk)
Böhm, Benjamin	QCDCL with Cube Learning or Pure Literal Elimination – What is best? (, talk)
G
Gaevoy, Nikita	Simulations between proof systems (, talk)
Galesi, Nicola	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (an extended abstract) (, talk)
Gaysin, Azza	Proof complexity of CSP (, talk)
H
Heule, Marijn	Exponential separations using guarded extension variables (, talk)
I
Itsykson, Dmitry	Proof complexity of natural formulas via communication arguments (, talk)
L
Lauria, Massimo	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (an extended abstract) (, talk)
M
Monroe, Hunter	Average-Case Hardness of Proving Tautologies and Theorems (, talk)
P
Peitl, Tomáš	QCDCL with Cube Learning or Pure Literal Elimination – What is best? (, talk) Are Hitting Formulas Hard for Resolution? (, talk)
R
Riazanov, Artur	Proof complexity of natural formulas via communication arguments (, talk)
S
Szeider, Stefan	Are Hitting Formulas Hard for Resolution? (, talk)
Y
Yolcu, Emre	Exponential separations using guarded extension variables (, talk)

Disclaimer | Powered by EasyChair Smart Program