Dependent sets of constant weight vectors in GF(q)
Proceedings of the seventh international conference on Random structures and algorithms
Satisfiability threshold for random XOR-CNF formulas
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Typical random 3-SAT formulae and the satisfiability threshold
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Constructing an asymptotic phase transition in random binary constraint satisfaction problems
Theoretical Computer Science - Phase transitions in combinatorial problems
Models and thresholds for random constraint satisfaction problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Generalized satisfiability problems: minimal elements and phase transitions
Theoretical Computer Science
Approximating the Satisfiability Threshold for Random k-XOR-formulas
Combinatorics, Probability and Computing
Dependent Sets of Constant Weight Binary Vectors
Combinatorics, Probability and Computing
Combinatorial sharpness criterion and phase transition classification for random CSPs
Information and Computation
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Random Structures & Algorithms
Many hard examples in exact phase transitions
Theoretical Computer Science
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Artificial Intelligence
Exact phase transitions in random constraint satisfaction problems
Journal of Artificial Intelligence Research
Consistency and random constraint satisfaction models
Journal of Artificial Intelligence Research
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Challenging heuristics: evolving binary constraint satisfaction problems
Proceedings of the 14th annual conference on Genetic and evolutionary computation
A general model and thresholds for random constraint satisfaction problems
Artificial Intelligence
Variable-Centered Consistency in Model RB
Minds and Machines
| Hi-index | 0.00 |
Constraint satisfaction has received increasing attention over the years. Intense research has focused on solving all kinds of constraint satisfaction problems (CSPs). In this paper, first we propose a random CSP model, named k-CSP, that guarantees the existence of phase transitions under certain circumstances. The exact location of the phase transition is quantified and experimental results are provided to illustrate the performance of the proposed model. Second, we revise the model k-CSP to a random linear CSP by incorporating certain linear structure to constraint relations. We also prove the existence of the phase transition and exhibit its exact location for this random linear CSP model.