On Random Betweenness Constraints

  title={On Random Betweenness Constraints},
  author={Andreas Goerdt},
  journal={Combinatorics, Probability & Computing},
Ordering constraints are formally analogous to instances of the satisfiability problem in conjunctive normal form, but instead of a boolean assignment we consider a linear ordering of the variables in question. A clause becomes true given a linear ordering iff the relative ordering of its variables obeys the constraint considered. The naturally arising satisfiability problems are NP-complete for many types of constraints. We look at random ordering constraints. Previous work of the author shows… CONTINUE READING