FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

B
Beckman, Arnold	Towards higher order proof complexity
Beyersdorff, Olaf	QCDCL with Cube Learning or Pure Literal Elimination – What is best?
Bonacina, Ilario	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares On combinatorial principles coming from semi-algebraic proof systems
Buss, Sam	Towards higher order proof complexity
Böhm, Benjamin	QCDCL with Cube Learning or Pure Literal Elimination – What is best?
C
Chew, Leroy	Strategy Extraction and Proof
D
Das, Anupam	Towards higher order proof complexity
G
Gaevoy, Nikita	Simulations between proof systems
Galesi, Nicola	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
Gaysin, Azza	Proof complexity of CSP
H
Heule, Marijn	Exponential separations using guarded extension variables
Hirsch, Edward	Strong proof systems based on algebraic circuits
I
Itsykson, Dmitry	Proof complexity of natural formulas via communication arguments
L
Lauria, Massimo	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
M
Monroe, Hunter	Hard Inputs from Kolmogorov Randomness---Can Merlin Tame Open Problems?
P
Peitl, Tomáš	QCDCL with Cube Learning or Pure Literal Elimination – What is best? QCDCL with Cube Learning or Pure Literal Elimination – What is best? (II) Are Hitting Formulas Hard for Resolution?
R
Riazanov, Artur	Proof complexity of natural formulas via communication arguments
S
Slivovsky, Friedrich	QBF Solvers and their Proof Systems
Szeider, Stefan	Are Hitting Formulas Hard for Resolution?
Y
Yolcu, Emre	Exponential separations using guarded extension variables

Disclaimer | Powered by EasyChair Smart Program