Publication:4952609
From MaRDI portal
zbMath0953.68150MaRDI QIDQ4952609
Pavel Pudlák, Russell Impagliazzo
Publication date: 10 May 2000
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
05C99: Graph theory
Related Items
Parameterized Complexity of DPLL Search Procedures, Finding kernels or solving SAT, Clique problem, cutting plane proofs and communication complexity, The depth of resolution proofs, Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas, A combinatorial characterization of treelike resolution space, Resolution lower bounds for perfect matching principles, On the complexity of resolution with bounded conjunctions, Hard satisfiable instances for DPLL-type algorithms