PC 2014 ABSTRACTS: AUTHOR INDEX

Papers Papers with Abstracts Preface Author Index Keyword Index

Shortcuts: A B C D F G I J L M N P R S T V

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