New algorithms solve Max 2-SAT exactly in polynomial space

Researchers have developed new deterministic algorithms capable of solving Max 2-SAT instances exactly within polynomial space. These algorithms achieve an exponential time complexity of O*(2^((1-gamma)n)) for certain classes of instances, even as clause density increases. The core innovation involves extending the DPLL branching algorithm by accumulating pruning constraints, which significantly reduces the search space by eliminating assignments that cannot be optimal. These advancements are particularly noted for their potential applicability to semirandom formulas and Max-Cut problems on specific graph models, offering the first polynomial-space algorithms with such time bounds for dense Max 2-SAT problems. AI

IMPACT Introduces novel algorithmic techniques that could potentially enhance the efficiency of solving complex combinatorial optimization problems, which may have downstream applications in AI research.

RANK_REASON Academic paper detailing new algorithms for a computational problem. [lever_c_demoted from research: ic=1 ai=0.4]

Read on arXiv cs.AI →

• 2-CNF
• arXiv
• DPLL algorithm
• Max 2-SAT
• maximum cut

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →