On bounded occurrence constraint satisfaction (Q1607037): Difference between revisions

@@ Property / author @@
-Johan T. Håstad
@@ Property / author: Johan T. Håstad / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q56959043
@@ Property / Wikidata QID: Q56959043 / rank @@
+Normal rank
@@ Property / author @@
+Johan T. Håstad
@@ Property / author: Johan T. Håstad / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252269
@@ Property / cites work: Q4252269 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Q4526964
@@ Property / cites work: Q4526964 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Q4250183
@@ Property / cites work: Q4250183 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(00)00032-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2091260378
@@ Property / OpenAlex ID: W2091260378 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1607037