FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

This page contains an index consisting of author-provided keywords.

A
algebraic complexity	Strong proof systems based on algebraic circuits
algebraic proof systems	Strong proof systems based on algebraic circuits
automatizability of proof systems	Simulations between proof systems
Average-case complexity	Hard Inputs from Kolmogorov Randomness---Can Merlin Tame Open Problems?
B
bit pigeonhole principle	Proof complexity of natural formulas via communication arguments
blocked clauses	Exponential separations using guarded extension variables
Bounded arithmetic	Proof complexity of CSP
C
CDCL	QCDCL with Cube Learning or Pure Literal Elimination – What is best? QCDCL with Cube Learning or Pure Literal Elimination – What is best? (II)
constraint satisfaction problems	Proof complexity of CSP
D
disjointness	Proof complexity of natural formulas via communication arguments
E
elementary computation	Towards higher order proof complexity
enumeration	Are Hitting Formulas Hard for Resolution?
extended resolution	Exponential separations using guarded extension variables
H
higher-order	Towards higher order proof complexity
hitting formulas	Are Hitting Formulas Hard for Resolution?
I
Invited Talk	On combinatorial principles coming from semi-algebraic proof systems
K
knapsack	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
L
lambda calculus	Towards higher order proof complexity
lower bounds	QCDCL with Cube Learning or Pure Literal Elimination – What is best? QCDCL with Cube Learning or Pure Literal Elimination – What is best? (II)
M
multiparty communication complexity	Proof complexity of natural formulas via communication arguments
N
Non-optimality of proof systems	Hard Inputs from Kolmogorov Randomness---Can Merlin Tame Open Problems?
O
optimal proof systems	Simulations between proof systems
P
perfect matching	Proof complexity of natural formulas via communication arguments
polynomial calculus	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
preprocessing	QBF Solvers and their Proof Systems
proof complexity	QCDCL with Cube Learning or Pure Literal Elimination – What is best? Simulations between proof systems Proof complexity of natural formulas via communication arguments Hard Inputs from Kolmogorov Randomness---Can Merlin Tame Open Problems? Proof complexity of CSP Towards higher order proof complexity Strong proof systems based on algebraic circuits On combinatorial principles coming from semi-algebraic proof systems Exponential separations using guarded extension variables QCDCL with Cube Learning or Pure Literal Elimination – What is best? (II) Strategy Extraction and Proof
propositional proof systems	Simulations between proof systems
Q
QBF	QCDCL with Cube Learning or Pure Literal Elimination – What is best? QCDCL with Cube Learning or Pure Literal Elimination – What is best? (II) QBF Solvers and their Proof Systems Strategy Extraction and Proof
R
randomized communication complexity	Proof complexity of natural formulas via communication arguments
resolution	Exponential separations using guarded extension variables
resolution complexity	Are Hitting Formulas Hard for Resolution?
Resolution over linear equations	Proof complexity of natural formulas via communication arguments
roots of unity	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
S
SAT encodings	Are Hitting Formulas Hard for Resolution?
separations	Exponential separations using guarded extension variables
solvers	QBF Solvers and their Proof Systems
strategy extraction	Strategy Extraction and Proof
sum-of-squares	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
symmetries	Are Hitting Formulas Hard for Resolution?
T
TBA	On combinatorial principles coming from semi-algebraic proof systems
tree-like proofs	Proof complexity of natural formulas via communication arguments
type theory	Towards higher order proof complexity

Disclaimer | Powered by EasyChair Smart Program