SAT-Problems and Reductions with Respect to the Number of Variables
From MaRDI portal
Publication:4351797
DOI10.1093/logcom/7.4.457zbMath0882.68075MaRDI QIDQ4351797
Etienne Grandjean, Hans Kleine Büning
Publication date: 28 August 1997
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/7.4.457
68Q25: Analysis of algorithms and problem complexity
Related Items
Lower bounds for kernelizations and other preprocessing procedures, Parameterized random complexity, The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs, k-SAT Is No Harder Than Decision-Unique-k-SAT, Lower Bounds for Kernelizations and Other Preprocessing Procedures