VSL 2014: VIENNA SUMMER OF LOGIC 2014

A
Aisenberg, James	Quasipolynomial Size Frege Proofs of Frankl's Theorem on the Trace of Finite Sets
Atserias, Albert	Weak Pigeonhole Principles, Circuits for Approximate Counting, and Bounded-Depth Proofs Narrow Proofs May Be Maximally Long
B
Beckmann, Arnold	Provably Total Search Problems in Fragments of Bounded Arithmetic Below Polynomial-time Parity games and propositional proofs
Beyersdorff, Olaf	Opening
Bonacina, Ilario	Total Space in Resolution
Bonet, Maria	Quasipolynomial Size Frege Proofs of Frankl's Theorem on the Trace of Finite Sets
Buss, Sam	Quasipolynomial Size Frege Proofs of Frankl's Theorem on the Trace of Finite Sets
C
Chen, Hubie	Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction
D
Das, Anupam	n^O(log log n) size monotone proofs of the weak pigeonhole principle
F
Filmus, Yuval	From Small Space to Small Width in Resolution Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds
G
Galesi, Nicola	Total Space in Resolution
I
Itsykson, Dmitry	Lower bounds for splittings by linear combinations
J
Jeřábek, Emil	Parameter-free induction in bounded arithmetic
Johannsen, Jan	Size-Space Bounds and Trade-offs for CDCL Proofs
L
Lauria, Massimo	Size-Space Bounds and Trade-offs for CDCL Proofs From Small Space to Small Width in Resolution Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds Narrow Proofs May Be Maximally Long
M
Miksa, Mladen	From Small Space to Small Width in Resolution Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds
N
Nordström, Jakob	Size-Space Bounds and Trade-offs for CDCL Proofs From Small Space to Small Width in Resolution A (Biased) Survey of Space Complexity and Time-Space Trade-offs in Proof Complexity Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds Narrow Proofs May Be Maximally Long
P
Pich, Ján	Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic
Pudlák, Pavel	On Some Conjectures in Proof Complexity Parity games and propositional proofs
R
Razafindrakoto, Jean-Jose	Provably Total Search Problems in Fragments of Bounded Arithmetic Below Polynomial-time
S
Sokolov, Dmitry	Lower bounds for splittings by linear combinations
T
Thapen, Neil	Total Space in Resolution Parity games and propositional proofs
Tzameret, Iddo	Are matrix identities hard instances for strong proof systems?
V
Vinyals, Marc	Size-Space Bounds and Trade-offs for CDCL Proofs From Small Space to Small Width in Resolution Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds

Disclaimer | Powered by EasyChair Smart Program