No. Title Author Year
1 Searching for Cryptogenography Upper Bounds via Sum of Square Programming Scheder, Dominik et al. 2019
2 PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster Scheder, Dominik et al. 2017
3 Tighter Hard Instances for PPSZ Pudlák, Pavel et al. 2017
4 Improving PPSZ for 3-SAT using Critical Variables Hertli, Timon et al. 2011
5 Unsatisfiable Linear CNF Formulas Are Large and Complex Scheder, Dominik 2010
Current Page :
Number of result pages: 1
Number of documents: 5


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