FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

A
automatizability of proof systems	Simulations between proof systems (, talk)
Average-case complexity	Average-Case Hardness of Proving Tautologies and Theorems (, talk)
B
bit pigeonhole principle	Proof complexity of natural formulas via communication arguments (, talk)
blocked clauses	Exponential separations using guarded extension variables (, talk)
Bounded arithmetic	Proof complexity of CSP (, talk)
C
CDCL	QCDCL with Cube Learning or Pure Literal Elimination – What is best? (, talk)
constraint satisfaction problems	Proof complexity of CSP (, talk)
D
disjointness	Proof complexity of natural formulas via communication arguments (, talk)
E
enumeration	Are Hitting Formulas Hard for Resolution? (, talk)
extended resolution	Exponential separations using guarded extension variables (, talk)
H
hitting formulas	Are Hitting Formulas Hard for Resolution? (, talk)
K
knapsack	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (an extended abstract) (, talk)
L
lower bounds	QCDCL with Cube Learning or Pure Literal Elimination – What is best? (, talk)
M
multiparty communication complexity	Proof complexity of natural formulas via communication arguments (, talk)
N
Non-optimality of proof systems	Average-Case Hardness of Proving Tautologies and Theorems (, talk)
O
optimal proof systems	Simulations between proof systems (, talk)
P
perfect matching	Proof complexity of natural formulas via communication arguments (, talk)
polynomial calculus	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (an extended abstract) (, talk)
proof complexity	Proof complexity of CSP (, talk) Exponential separations using guarded extension variables (, talk) Average-Case Hardness of Proving Tautologies and Theorems (, talk) Proof complexity of natural formulas via communication arguments (, talk) Simulations between proof systems (, talk) QCDCL with Cube Learning or Pure Literal Elimination – What is best? (, talk)
propositional proof systems	Simulations between proof systems (, talk)
Q
QBF	QCDCL with Cube Learning or Pure Literal Elimination – What is best? (, talk)
R
randomized communication complexity	Proof complexity of natural formulas via communication arguments (, talk)
resolution	Exponential separations using guarded extension variables (, talk)
resolution complexity	Are Hitting Formulas Hard for Resolution? (, talk)
Resolution over linear equations	Proof complexity of natural formulas via communication arguments (, talk)
roots of unity	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (an extended abstract) (, talk)
S
SAT encodings	Are Hitting Formulas Hard for Resolution? (, talk)
separations	Exponential separations using guarded extension variables (, talk)
sum-of-squares	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (an extended abstract) (, talk)
symmetries	Are Hitting Formulas Hard for Resolution? (, talk)
T
tree-like proofs	Proof complexity of natural formulas via communication arguments (, talk)

Disclaimer | Powered by EasyChair Smart Program