A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558): Difference between revisions

@@ Property / author @@
-John V. Franco
@@ Property / author: John V. Franco / rank @@
-Normal rank
@@ Property / author @@
-Allen van Gelder
@@ Property / author: Allen van Gelder / rank @@
-Normal rank
@@ Property / author @@
+John V. Franco
@@ Property / author: John V. Franco / rank @@
+Normal rank
@@ Property / author @@
+Allen van Gelder
@@ Property / author: Allen van Gelder / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Leibniz
@@ Property / describes a project that uses: Leibniz / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3661894
@@ Property / cites work: Q3661894 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
+Normal rank
@@ Property / cites work @@
+Q4004078
@@ Property / cites work: Q4004078 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+Recognizing disguised NR(1) instances of the satisfiability problem
+Normal rank
@@ Property / cites work @@
+Q4542576
@@ Property / cites work: Q4542576 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3682518
@@ Property / cites work: Q3682518 / rank @@
+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 @@
+A Complexity Index for Satisfiability Problems
@@ Property / cites work: A Complexity Index for Satisfiability Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140436
@@ Property / cites work: Q3140436 / rank @@
+Normal rank
@@ Property / cites work @@
+Extended Horn sets in propositional logic
@@ Property / cites work: Extended Horn sets in propositional logic / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
+Normal rank
@@ Property / cites work @@
+Q4228436
@@ Property / cites work: Q4228436 / rank @@
+Normal rank
@@ Property / cites work @@
+Many hard examples for resolution
@@ Property / cites work: Many hard examples for resolution / rank @@
+Normal rank
@@ Property / cites work @@
+A hierarchy of tractable satisfiability problems
@@ Property / cites work: A hierarchy of tractable satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for testing the satisfiability of propositional horn formulae
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+Q4375759
@@ Property / cites work: Q4375759 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
+Normal rank
@@ Property / cites work @@
+A perspective on certain polynomial-time solvable classes of satisfiability
+Normal rank
@@ Property / cites work @@
+Analysis of Two Simple Heuristics on a Random Instance ofk-sat
+Normal rank
@@ Property / cites work @@
+A threshold for unsatisfiability
@@ Property / cites work: A threshold for unsatisfiability / rank @@
+Normal rank
@@ Property / cites work @@
+On Representatives of Subsets
@@ Property / cites work: On Representatives of Subsets / rank @@
+Normal rank
@@ Property / cites work @@
+A Proof Procedure Using Connection Graphs
@@ Property / cites work: A Proof Procedure Using Connection Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Investigations on autark assignments
@@ Property / cites work: Investigations on autark assignments / rank @@
+Normal rank
@@ Property / cites work @@
+Renaming a Set of Clauses as a Horn Set
@@ Property / cites work: Renaming a Set of Clauses as a Horn Set / rank @@
+Normal rank
@@ Property / cites work @@
+A short note on some tractable cases of the satisfiability problem.
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+On finding solutions for extended Horn formulas
@@ Property / cites work: On finding solutions for extended Horn formulas / rank @@
+Normal rank
@@ Property / cites work @@
+A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
+Normal rank
@@ Property / cites work @@
+A simplified NP-complete satisfiability problem
@@ Property / cites work: A simplified NP-complete satisfiability problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4705311
@@ Property / cites work: Q4705311 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5687274
@@ Property / cites work: Q5687274 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1861558