The Approximation Ratio for Boolean Max-k-CSP

Removes the constant factor from the previous best guarantee; whether $k/2^k$ is optimal is not settled here.

15Significance / 100

1Frontier events

0Verification tasks

0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

algorithms-optimizationAug 5, 2026Significance 15/100Registry: unreviewed

Prior state unknown→proved

Removes the constant factor from the previous best guarantee; whether $k/2^k$ is optimal is not settled here.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Source authenticated

Removes the constant factor from the previous best guarantee; whether $k/2^k$ is optimal is not settled here.

Removes the constant factor from the previous best guarantee; whether $k/2^k$ is optimal is not settled here.

Evidence graph