A CNF Formula Hierarchy over the Hypercube (Q5385533): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-76928-6_25
+Normal rank
@@ Property / OpenAlex ID @@
+W1594040910
@@ Property / OpenAlex ID: W1594040910 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+Polynomial-time inference of all valid implications for Horn and related formulae
+Normal rank
@@ Property / cites work @@
+Recognition of \(q\)-Horn formulae in linear time
@@ Property / cites work: Recognition of \(q\)-Horn formulae in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+A perspective on certain polynomial-time solvable classes of satisfiability
+Normal rank
@@ Property / cites work @@
+Solving satisfiability in less than \(2^ n\) steps
+Normal rank