| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Impatient PPSZ - A Faster Algorithm for CSP | Li, Shibo et al. | 2021 |
| 2 | Super Strong ETH Is True for PPSZ with Small Resolution Width | Scheder, Dominik et al. | 2020 |
| 3 | Searching for Cryptogenography Upper Bounds via Sum of Square Programming | Scheder, Dominik et al. | 2019 |
| 4 | PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster | Scheder, Dominik et al. | 2017 |
| 5 | Tighter Hard Instances for PPSZ | Pudlák, Pavel et al. | 2017 |
| 6 | Improving PPSZ for 3-SAT using Critical Variables | Hertli, Timon et al. | 2011 |
| 7 | Unsatisfiable Linear CNF Formulas Are Large and Complex | Scheder, Dominik | 2010 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |