Maximum Cut on Random d-regular graphs G(n, d=4)
91.1Lower Bound Ratio
Theorem 2.1 (AlphaEvolve)
Updated 1mo ago
Evaluation Results
| Method | Links | ||
|---|---|---|---|
2025.09 | 91.1 | - | |
2025.09 | 87.5 | - | |
2025.09 | - | 91.6 | |
2025.09 | - | 93.3 |
Theorem 2.1 (AlphaEvolve)
| Method | Links | ||
|---|---|---|---|
2025.09 | 91.1 | - | |
2025.09 | 87.5 | - | |
2025.09 | - | 91.6 | |
2025.09 | - | 93.3 |