The Approximation Ratio for Boolean Max-k-CSP
How well can an arbitrary boolean constraint satisfaction problem of arity be approximated in polynomial time? The paper gives a -approximation, improving the previous best constant of due to Makarychev and Makarychev.
- Result
- Proved(see note)
- Status
- Partial result
- AI contribution
- AI-assisted
- Method
- Argument
- Field
- Approximation algorithms
- Posed by
- —
- Year posed
- —
- Years open
- —
- Solved
- 2026-08-05
- Model
- GPT-5.6 Sol Max
- Vendor
- OpenAI
- Collaborators
- Ainesh Bakshi
- Verification
- Unreviewed
- Publication
- Preprint
- Significance
- 15 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What was actually shown
Removes the constant factor from the previous best guarantee; whether is optimal is not settled here.
What the AI did
"GPT 5.6 Sol Max assisted in the lengthy computations that appear in the proof." Computational support inside a human-led argument.
Verification
A preprint days old, with no independent review.