The complexity of homomorphisms and renamings for minimal unsatisfiable formulas (Q1777396): Difference between revisions

@@ Property / cites work @@
+Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
+Normal rank
@@ Property / cites work @@
+Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.
+Normal rank
@@ Property / cites work @@
+Q4273947
@@ Property / cites work: Q4273947 / rank @@
+Normal rank
@@ Property / cites work @@
+Short proofs for tricky formulas
@@ Property / cites work: Short proofs for tricky formulas / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of facets resolved
@@ Property / cites work: The complexity of facets resolved / rank @@
+Normal rank
@@ Property / cites work @@
+Homomorphisms of conjunctive normal forms.
@@ Property / cites work: Homomorphisms of conjunctive normal forms. / rank @@
+Normal rank
@@ Property / cites work @@
+The symmetry rule in propositional logic
@@ Property / cites work: The symmetry rule in propositional logic / rank @@
+Normal rank