No. Title Author Year
1 Proof Complexity (Dagstuhl Seminar 18051) Atserias, Albert et al. 2018
2 Random Resolution Refutations Pudlák, Pavel et al. 2017
3 Representations of Monotone Boolean Functions by Linear Programs de Oliveira Oliveira, Mateus et al. 2017
4 Tighter Hard Instances for PPSZ Pudlák, Pavel et al. 2017
5 The Space Complexity of Cutting Planes Refutations Galesi, Nicola et al. 2015
6 Partition Expanders Gavinsky, Dmitry et al. 2014
7 On extracting computations from propositional proofs (a survey) Pudlák, Pavel 2010
8 06111 Abstracts Collection -- Complexity of Boolean Functions Krause, Matthias et al. 2006
9 06111 Executive Summary -- Complexity of Boolean Functions Krause, Matthias et al. 2006
Current Page :
Number of result pages: 1
Number of documents: 9


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI