Geometric properties of satisfying assignments of random εε-1-in-k SAT

preprint2008arXivOpen access

Abstract

We study the geometric structure of the set of solutions of random εε-1-in-k SAT problem. For l≥1l\geq 1, two satisfying assignments AA and BB are ll-connected if there exists a sequence of satisfying assignments connecting them by changing at most ll bits at a time. We first prove that w.h.p. two assignments of a random εε-1-in-kk SAT instance are O(log⁡n)O(\log n)-connected, conditional on being satisfying assignments. Also, there exists ε0∈(0,1k−2)ε_{0}\in (0,\frac{1}{k-2}) such that w.h.p. no two satisfying assignments at distance at least ε0⋅nε_{0}\cdot n form a "hole" in the set of assignments. We believe that this is true for all ε>0ε>0, and thus satisfying assignments of a random 1-in-kk SAT instance form a single cluster.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.