FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

B
Berkholz, Christoph	A Comparison of Algebraic and Semi-Algebraic Proof Systems
Bonet, Maria	On Dual-Rail Based MaxSAT Solving
Buss, Samuel	Complexity of expander-based reasoning and the power of monotone proofs On OBBD Proofs On Dual-Rail Based MaxSAT Solving
C
Capelli, Florent	Proof systems for #SAT based on restricted circuits
D
Dantchev, Stefan	Resolution and the binary encoding of combinatorial principles
Das, Anupam	Towards theories for positive polynomial time and monotone proofs with extension
de Wolff, Timo	Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials
Dressler, Mareike	Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials
G
Galesi, Nicola	Space Proof Complexity beyond Resolution Resolution and the binary encoding of combinatorial principles
I
Ignatiev, Alexey	On Dual-Rail Based MaxSAT Solving
K
Kabanets, Valentine	Complexity of expander-based reasoning and the power of monotone proofs
Knop, Alexander	Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas
Kolokolova, Antonina	Complexity of expander-based reasoning and the power of monotone proofs
Koucky, Michal	Complexity of expander-based reasoning and the power of monotone proofs
Kurpisz, Adam	Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials
M
Marques-Silva, Joao	On Dual-Rail Based MaxSAT Solving
Martin, Barnaby	Resolution and the binary encoding of combinatorial principles
Morgado, Antonio	On Dual-Rail Based MaxSAT Solving
P
Part, Fedor	Resolution with Counting: Different Moduli and Tree-Like Lower Bounds
T
Tzameret, Iddo	Resolution with Counting: Different Moduli and Tree-Like Lower Bounds

Disclaimer | Powered by EasyChair Smart Program