Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C22
@@ Property / Mathematics Subject Classification ID: 90C22 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6050356
@@ Property / zbMATH DE Number: 6050356 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+NP-complete problems
@@ Property / zbMATH Keywords: NP-complete problems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithm
@@ Property / zbMATH Keywords: approximation algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+proof complexity
@@ Property / zbMATH Keywords: proof complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+lift and project methods
@@ Property / zbMATH Keywords: lift and project methods / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+matrix cut operators
@@ Property / zbMATH Keywords: matrix cut operators / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+lower bounds
@@ Property / zbMATH Keywords: lower bounds / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+random instances of 3SAT
@@ Property / zbMATH Keywords: random instances of 3SAT / rank @@
+Normal rank

Revision as of 23:50, 29 June 2023