The complexity of homomorphisms and renamings for minimal unsatisfiable formulas
暂无分享,去创建一个
[1] Hans Kleine Büning,et al. Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency , 2002, Inf. Process. Lett..
[2] Christos H. Papadimitriou,et al. The complexity of facets resolved , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[3] Hans Kleine Büning,et al. An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF , 1998, Annals of Mathematics and Artificial Intelligence.
[4] Stefan Szeider,et al. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference , 2002, Theor. Comput. Sci..
[5] Stefan Szeider. Homomorphisms of conjunctive normal forms , 2003, Discret. Appl. Math..
[6] Jaroslav Nesetril,et al. On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.
[7] Balakrishnan Krishnamurthy. Short proofs for tricky formulas , 2004, Acta Informatica.
[8] Nathan Linial,et al. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas , 1986, J. Comb. Theory, Ser. A.
[9] Alasdair Urquhart,et al. The Symmetry Rule in Propositional Logic , 1999, Discret. Appl. Math..