Ondrej Cepek, Stefan Gurský. On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas. In International Symposium on Artificial Intelligence and Mathematics, ISAIM 2014, Fort Lauderdale, FL, USA, January 6-8, 2014. 2014. [doi]
Abstract is missing.