Author:
Creignou Nadia,Daudé Hervé
Subject
Discrete Mathematics and Combinatorics
Reference17 articles.
1. Estimating satisfiability;Boufkhad;Discrete Applied Mathematics,2012
2. Bounds on the time for parallel ram’s to compute simple functions;Cook,1982
3. Combinatorial sharpness criterion and phase transition classification for random CSPs;Creignou;Information and Computation,2004
4. The SAT–UNSAT transition for random constraint satisfaction problems;Creignou;Discrete Mathematics,2009
5. N. Creignou, H. Daudé, O. Dubois, Expected number of locally maximal solutions for random boolean CSPs, in: Proc. of 13th International Conference on Analysis of Algorithms, AofA’07, DMTCS, 2007.