A \(2^{|E|/4}\)-time algorithm for MAX-CUT (Q2577592): Difference between revisions

@@ Property / DOI @@
-.1007/s10958-005-0101-7
@@ Property / DOI: 10.1007/s10958-005-0101-7 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+MAX-2-SAT
@@ Property / describes a project that uses: MAX-2-SAT / 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.1007/s10958-005-0101-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2000579976
@@ Property / OpenAlex ID: W2000579976 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+Normal rank
@@ Property / cites work @@
+An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
+Normal rank
@@ Property / cites work @@
+Algorithms for Sat and upper bounds on their complexity
+Normal rank
@@ Property / cites work @@
+Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
+Normal rank
@@ Property / cites work @@
+Q4840774
@@ Property / cites work: Q4840774 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / DOI @@
+.1007/S10958-005-0101-7
@@ Property / DOI: 10.1007/S10958-005-0101-7 / rank @@
+Normal rank