On the satisfiability of random regular signed SAT formulas

Details On the satisfiability of random regular signed SAT formulas On the satisfiability of random regular signed SAT formulas

2011-12-06

arxiv.org/abs/1112.1360v1

Computer Science

Discrete Mathematics

12 pages

Scientific paper

Regular signed SAT is a variant of the well-known satisfiability problem in which the variables can take values in a fixed set V \subset [0,1], and the `literals' have the form "x \le a" or "x \ge a". We answer some open question regarding random regular signed k-SAT formulas: the probability that a random formula is satisfiable increases with |V|; there is a constant upper bound on the ratio m/n of clauses m over variables n, beyond which a random formula is asypmtotically almost never satisfied; for k=2 and V=[0,1], there is a phase transition at m/n=2.

Affiliated with

Also associated with

No associations

Rating

On the satisfiability of random regular signed SAT formulas does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the satisfiability of random regular signed SAT formulas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the satisfiability of random regular signed SAT formulas will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-381694