On the r,s-SAT satisfiability problem and a conjecture of Tovey (Q1822964): Difference between revisions

@@ Property / Wikidata QID @@
+Q123152755
@@ Property / Wikidata QID: Q123152755 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+Q4138187
@@ Property / cites work: Q4138187 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+Two-Processor Scheduling with Start-Times and Deadlines
+Normal rank
@@ Property / cites work @@
+On Representatives of Subsets
@@ Property / cites work: On Representatives of Subsets / rank @@
+Normal rank
@@ Property / cites work @@
+A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
+Normal rank
@@ Property / cites work @@
+The Euclidean traveling salesman problem is NP-complete
+Normal rank
@@ Property / cites work @@
+A simplified NP-complete satisfiability problem
@@ Property / cites work: A simplified NP-complete satisfiability problem / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0166-218x(90)90020-d
+Normal rank
@@ Property / OpenAlex ID @@
+W2066022804
@@ Property / OpenAlex ID: W2066022804 / rank @@
+Normal rank