Sharp thresholds for constraint satisfaction problems and homomorphisms
暂无分享,去创建一个
[1] Toby Walsh,et al. Random Constraint Satisfaction: Flaws and Structure , 2004, Constraints.
[2] Miklós Simonovits,et al. Supersaturated graphs and hypergraphs , 1983, Comb..
[3] Cristopher Moore,et al. The phase transition in 1-in-k SAT and NAE 3-SAT , 2001, SODA '01.
[4] Michael Krivelevich,et al. Sharp thresholds for certain Ramsey properties of random graphs , 2000, Random Struct. Algorithms.
[5] E. Friedgut,et al. Sharp thresholds of graph properties, and the -sat problem , 1999 .
[6] Michael Molloy,et al. A sharp threshold in proof complexity , 2001, STOC '01.
[7] Michael Molloy. Models and thresholds for random constraint satisfaction problems , 2002, STOC '02.
[8] Olivier Dubois,et al. The 3-XORSAT threshold , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[9] Cristopher Moore,et al. The asymptotic order of the random k-SAT threshold , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[10] O. Dubois,et al. On the non-3-colourability of random graphs , 2002 .
[11] Andreas Goerdt. A Threshold for Unsatisfiability , 1996, J. Comput. Syst. Sci..
[12] E. Friedgut. Hunting for sharp thresholds , 2005 .
[13] W. T. Gowers,et al. RANDOM GRAPHS (Wiley Interscience Series in Discrete Mathematics and Optimization) , 2001 .
[14] Yannis C. Stamatiou,et al. Random Constraint Satisfaction a More Accurate Picture , 2022 .
[15] S. Janson,et al. Bounding the unsatisfiability threshold of random 3-SAT , 2000 .
[16] Gabriel Istrate. Threshold properties of random boolean constraint satisfaction problems , 2005, Discret. Appl. Math..
[17] André Raspaud,et al. Good and Semi-Strong Colorings of Oriented Planar Graphs , 1994, Inf. Process. Lett..
[18] Nadia Creignou,et al. Combinatorial sharpness criterion and phase transition classification for random CSPs , 2004, Inf. Comput..
[19] Gabriel Istrate. Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems , 2005, ArXiv.
[20] Nadia Creignou,et al. Generalized satisfiability problems: minimal elements and phase transitions , 2003, Theor. Comput. Sci..
[21] Steven Kelk,et al. The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random , 2004, SIAM J. Comput..
[22] J. W. P. Hirschfeld,et al. Thresholds for colourability and satisfiability in random graphs and boolean formulae , 2001 .
[23] Abraham D. Flaxman. A sharp threshold for a random constraint satisfaction problem , 2004, Discret. Math..
[24] Endre Szemerédi,et al. Many hard examples for resolution , 1988, JACM.
[25] David G. Mitchell,et al. Resolution Complexity of Random Constraints , 2002, CP.
[26] D. Achlioptas,et al. A sharp threshold for k-colorability , 1999 .
[27] Wei Li,et al. Exact Phase Transitions in Random Constraint Satisfaction Problems , 2000, J. Artif. Intell. Res..
[28] Jaroslav Nesetril,et al. On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.
[29] Mohammad R. Salavatipour,et al. The Resolution Complexity of Random Constraint Satisfaction Problems , 2007, SIAM J. Comput..
[30] Michael Molloy,et al. The exact satisfiability threshold for a potentially intractable random constraint satisfaction problem , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[31] Bruce A. Reed,et al. Mick gets some (the odds are on his side) (satisfiability) , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.