Are hitting formulas hard for resolution? (Q6162037): Difference between revisions

@@ Property / cites work @@
+Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
+Normal rank
@@ Property / cites work @@
+Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
+Normal rank
@@ Property / cites work @@
+Q5715680
@@ Property / cites work: Q5715680 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+A Computing Procedure for Quantification Theory
@@ Property / cites work: A Computing Procedure for Quantification Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+New width parameters for SAT and \#SAT
@@ Property / cites work: New width parameters for SAT and \#SAT / rank @@
+Normal rank
@@ Property / cites work @@
+The intractability of resolution
@@ Property / cites work: The intractability of resolution / rank @@
+Normal rank
@@ Property / cites work @@
+CNF-Satisfiability Test by Counting and Polynomial Average Time
+Normal rank
@@ Property / cites work @@
+On subclasses of minimal unsatisfiable formulas
@@ Property / cites work: On subclasses of minimal unsatisfiable formulas / rank @@
+Normal rank
@@ Property / cites work @@
+Q2741513
@@ Property / cites work: Q2741513 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of read-once resolution
@@ Property / cites work: The complexity of read-once resolution / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of some classes of minimal unsatisfiable formulas
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Green-Tao Numbers and SAT
@@ Property / cites work: Green-Tao Numbers and SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency
+Normal rank
@@ Property / cites work @@
+On Davis-Putnam reductions for minimally unsatisfiable clause-sets
+Normal rank
@@ Property / cites work @@
+Practical graph isomorphism. II.
@@ Property / cites work: Practical graph isomorphism. II. / rank @@
+Normal rank
@@ Property / cites work @@
+Solving \#SAT using vertex covers
@@ Property / cites work: Solving \#SAT using vertex covers / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability of acyclic and almost acyclic CNF formulas
+Normal rank
@@ Property / cites work @@
+Finding the Hardest Formulas for Resolution
@@ Property / cites work: Finding the Hardest Formulas for Resolution / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of clause-learning SAT solvers as resolution engines
+Normal rank
@@ Property / cites work @@
+On the hardness of approximate reasoning
@@ Property / cites work: On the hardness of approximate reasoning / rank @@
+Normal rank
@@ Property / cites work @@
+Q3515550
@@ Property / cites work: Q3515550 / rank @@
+Normal rank
@@ Property / cites work @@
+Hard examples for resolution
@@ Property / cites work: Hard examples for resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Q3434502
@@ Property / cites work: Q3434502 / rank @@
+Normal rank