Single-solution Random 3-SAT Instances
Marko Znidaric
Abstract
We study a class of random 3-SAT instances having exactly one solution. The properties of this ensemble considerably differ from those of a random 3-SAT ensemble. It is numerically shown that the running time of several complete and stochastic local search algorithms monotonically increases as the clause density is decreased. Therefore, there is no easy-hard-easy pattern of hardness as for standard random 3-SAT ensemble. Furthermore, the running time for short single-solution formulas increases with the problem size much faster than for random 3-SAT formulas from the phase transition region.
Create a lesson
Related papers
BEAKER: An Expert-Curated Benchmark for Embodied Brains in Self-Driving Chemical Laboratories
Fei Lin, Tengchao Zhang, Ziyang Gong et al.
FrontierPhysics: Evaluating Agents for End-to-End Physics Research
Bingran You, Wenjun Ke, Ria Rosenauer et al.
Dull, Dirty, Dangerous? Working Conditions and the Limits of Occupational AI Exposure
Siyi Yu
Learning to Decode Linear Codes with Generalized Belief Propagation Network
Samira Malek
On Turn-Level Best-of-N Sampling for Scaling LLM Agents
Jalaj Bhandari, Dhawal Gupta, Hongli Zhan et al.
CompressionBench: How can your coding agents compress LLMs?
Xinrui Zhong, Zhifeng Li, Zhiming Wang et al.