A simplified NP-complete MAXSAT problem (Q293164): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Two-Processor Scheduling with Start-Times and Deadlines
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the maximum satisfiability problem for Horn formulas
+Normal rank
@@ Property / cites work @@
+The Minimum Satisfiability Problem
@@ Property / cites work: The Minimum Satisfiability Problem / rank @@
+Normal rank
@@ Property / cites work @@
+One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete
+Normal rank
@@ Property / cites work @@
+Solving satisfiability in less than \(2^ n\) steps
+Normal rank
@@ Property / cites work @@
+The Euclidean traveling salesman problem is NP-complete
+Normal rank
@@ Property / cites work @@
+Q4283247
@@ Property / cites work: Q4283247 / rank @@
+Normal rank
@@ Property / cites work @@
+A simplified NP-complete satisfiability problem
@@ Property / cites work: A simplified NP-complete satisfiability problem / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2052367117
@@ Property / OpenAlex ID: W2052367117 / rank @@
+Normal rank