Research map / Learning theory and algorithms / Combinatorial and search optimization
Low-Rank Semidefinite Programming for the MAX2SAT Problem
Po-Wei Wang, J. Zico Kolter
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use low-rank SDP with the Mixing method and branch-and-bound instead of the competition solvers | MIXSAT on MAX2SAT · MAX2SAT 2016 random, complete track | instances solved within 30 minutes: 145 -> 169 | Improved |
| Use low-rank SDP with the Mixing method and branch-and-bound instead of the competition solvers | MIXSAT on MAX2SAT · MAX2SAT 2016 random, incomplete track | average time to solution: 1.92 sec -> 0.22 sec; 8.72x faster | Improved |
| Use MIXSAT instead of the best competition solvers | MIXSAT · Crafted MAXCUT 2016/2018 | average time to optimal solution: 1.84 sec -> 0.62 sec; 3x faster | Improved |
| Apply MIXSAT to random MAX3SAT instances | MIXSAT · Random MAX3SAT 2016 | instances outperforming best solvers: 114/144; didn't recover the optimal solution for 2 instances | Mixed |
Closest papers by meaning
- Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT (AAAI 2025 · similarity 0.87)
- Enhance Diversified Top-k MaxSAT Solving by Incorporating New Strategy for Generating Diversified Initial Assignments (Student Abstract) (AAAI 2024 · similarity 0.86)
- Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph (AAAI 2024 · similarity 0.85)
- Better Understandings and Configurations in MaxSAT Stochastic Local Search Solvers via Anytime Performance Analysis (AAAI 2025 · similarity 0.85)
- DiverSAT: A Novel and Effective Local Search Algorithm for Diverse SAT Problem (AAAI 2025 · similarity 0.84)
- SAT-Based Tree Decomposition with Iterative Cascading Policy Selection (AAAI 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
