A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors (Q3502705): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-79719-7_16
+Normal rank
@@ Property / OpenAlex ID @@
+W2114975369
@@ Property / OpenAlex ID: W2114975369 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+An improved deterministic local search algorithm for 3-SAT
+Normal rank
@@ Property / cites work @@
+On good algorithms for determining unsatisfiability of propositional formulas
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / 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 @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability of mixed Horn formulas
@@ Property / cites work: Satisfiability of mixed Horn formulas / rank @@
+Normal rank
@@ Property / cites work @@
+Matched Formulas and Backdoor Sets
@@ Property / cites work: Matched Formulas and Backdoor Sets / rank @@
+Normal rank