Linear Branching Programs and Directional Affine Extractors | 0 | 0.34 | 2022 |
A Variant of the VC-Dimension with Applications to Depth-3 Circuits. | 0 | 0.34 | 2022 |
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. | 0 | 0.34 | 2021 |
Cops-Robber Games and the Resolution of Tseitin Formulas | 0 | 0.34 | 2020 |
Super Strong ETH is true for strong PPSZ. | 0 | 0.34 | 2020 |
Super Strong ETH Is True for PPSZ with Small Resolution Width. | 0 | 0.34 | 2020 |
A SEPARATOR THEOREM FOR HYPERGRAPHS AND A CSP-SAT ALGORITHM | 0 | 0.34 | 2019 |
Prediction from Partial Information and Hindsight, an Alternative Proof. | 0 | 0.34 | 2018 |
Cops-Robber Games and the Resolution of Tseitin Formulas. | 0 | 0.34 | 2018 |
Strong ETH and Resolution via Games and the Multiplicity of Strategies. | 0 | 0.34 | 2017 |
Tighter Hard Instances for PPSZ. | 1 | 0.37 | 2017 |
On the structure and the number of prime implicants of 2-s. | 0 | 0.34 | 2016 |
Improving resolution width lower bounds for k -CNFs with applications to the Strong Exponential Time Hypothesis | 1 | 0.35 | 2016 |
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. | 1 | 0.35 | 2014 |
On the Structure and the Number of Prime Implicants of k-CNF Formulas. | 0 | 0.34 | 2014 |
Exponential Lower Bounds for the PPSZ k-SAT Algorithm. | 3 | 0.42 | 2013 |