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
RAFT: A Stateful Retrieval-Augmented Framework for Troubleshooting Agents
Mingxuan Zhang, Xiaowen Wang, Anupma Sharan et al.
Q&A on Any Spreadsheet Requires Interpreting Its Grid Structure
Zofia Smoleń
Deep Noir: Autonomous Steering Discovery via Architectural Chronometry in Transformer Models
Frank E. Bobe, Gregory D. Vetaw, Darshan W. Bryner et al.
Ownership in AI-Assisted Everyday Tasks
Megan Wei, Melanie Subbiah, Audrey Lee et al.
PAA: The Probabilistic Allen Algebra: A Generative and Complete Probabilistic Extension of Allen's Interval Relations
Julian Eggert
Limits of Confidence in Diffusion
Russ Webb, Amitis Shidani, Alice Bizeul et al.