Is constraint satisfaction over two variables always easy? (Q3156915): Difference between revisions

@@ Property / describes a project that uses @@
+Outward rotations
@@ Property / describes a project that uses: Outward rotations / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/rsa.20026
@@ Property / full work available at URL: https://doi.org/10.1002/rsa.20026 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2097646889
@@ Property / OpenAlex ID: W2097646889 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4251055
@@ Property / cites work: Q4251055 / rank @@
+Normal rank
@@ Property / cites work @@
+A new multilayered PCP and the hardness of hypergraph vertex cover
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
+Normal rank
@@ Property / cites work @@
+On the power of unique 2-prover 1-round games
@@ Property / cites work: On the power of unique 2-prover 1-round games / rank @@
+Normal rank
@@ Property / cites work @@
+Q4146884
@@ Property / cites work: Q4146884 / rank @@
+Normal rank
@@ Property / cites work @@
+Outward rotations
@@ Property / cites work: Outward rotations / rank @@
+Normal rank