A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+T20
@@ Property / Mathematics Subject Classification ID: 68T20 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6033497
@@ Property / zbMATH DE Number: 6033497 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+exponential-time algorithm
@@ Property / zbMATH Keywords: exponential-time algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polynomial space
@@ Property / zbMATH Keywords: polynomial space / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+satisfiability
@@ Property / zbMATH Keywords: satisfiability / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+constraint satisfaction
@@ Property / zbMATH Keywords: constraint satisfaction / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+hybrid instances
@@ Property / zbMATH Keywords: hybrid instances / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+measure and conquer
@@ Property / zbMATH Keywords: measure and conquer / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+convex programming
@@ Property / zbMATH Keywords: convex programming / rank @@
+Normal rank

Revision as of 20:24, 29 June 2023