A branch-and-cut approach to physical mapping with end-probes
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
An algebra for cyclic ordering of 2D orientations
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Geometric Approach to Betweenness
SIAM Journal on Discrete Mathematics
On the satisfiability and maximum satisfiability of random 3-CNF formulas
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Typical random 3-SAT formulae and the satisfiability threshold
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Models and thresholds for random constraint satisfaction problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The Efficiency of Resolution and Davis--Putnam Procedures
SIAM Journal on Computing
Cores in random hypergraphs and Boolean formulas
Random Structures & Algorithms
Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
Random $k$-SAT: Two Moments Suffice to Cross a Sharp Threshold
SIAM Journal on Computing
Hardness of fully dense problems
Information and Computation
The complexity of temporal constraint satisfaction problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Sharp thresholds for constraint satisfaction problems and homomorphisms
Random Structures & Algorithms
Algorithmic Barriers from Phase Transitions
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
When does the giant component bring unsatisfiability?
Combinatorica
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Journal of Computer and System Sciences
An electromagnetism metaheuristic for solving the Maximum Betweenness Problem
Applied Soft Computing
| Hi-index | 0.00 |
Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, 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 formany types of constraints. We look at random ordering constraints. Previous work of the author shows that there is a sharp unsatisfiability threshold for certain types of constraints. The value of the threshold however is essentially undetermined. We pursue the problem to approximate the precise value of the threshold. We show that random instances of the betweenness constraint (definition see Subsection 1.1) are satisfiable with high probability iff the number of randomly picked clauses is n, where n is the number of variables considered. This improves the previous bound which is n random clauses.