9 citations · 10 across the 4 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2025
Discovering heuristics in a complex SAT solver with large language models
Yiwen Sun, Furong Ye, Zhihan Chen +2
The Satisfiability problem (SAT) is fundamental in computational complexity theory and has a wide range of industrial applications. Optimizing modern SAT solvers in real-world sett…
cs.AI2024★ 1 cited
ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization
Zhihan Chen, Peng Lin, Hao Hu +1
As a broadly applied technique in numerous optimization problems, recently, local search has been employed to solve Pseudo-Boolean Optimization (PBO) problem. A representative loca…