Measures of intrinsic hardness for constraint satisfaction problem instances

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2932, Issue , 2003, Pages 184-195

  Boukeas, George ^a   Halatsis, Constantinos ^a   Zissimopoulos, Vassilis ^a   Stamatopoulos, Panagiotis ^a  

^a UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

HARDNESS;

HARDNESS MEASURES; INITIAL STATE; INTRINSIC HARDNESS; SEARCH SPACES; SOLUTION PATH;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35048853552     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (13)

1. Williams, C., Hogg, T.: Exploiting the Deep Structure of Constraint Problems. Artificial Intelligence 70 (1994) 73-117
2. Gent, I.P., MacIntyre, E., Prosser, P., Walsh, T.: The Constrainedness of Search. In: AAAI/IAAI. Volume 1. (1996) 246-252
3. Parkes, A.J.: Clustering at the Phase Transition. In: AAAI/IAAI. (1997) 340-345
4. Shannon, C.E.: A Mathematical Theory of Communication. The Bell Systems Technical Journal 27 (1948) Reprinted with corrections
5. Slaney, J.: Is there a Constrainedness Knife-Edge? In: Proceedings of the 14th European Conference on Artificial Intelligence. (2000) 614-618
6. Hogg, T., Huberman, B., Williams, C.: Phase Transitions and the Search Problem. Artificial Intelligence 81 (1996) 1-15
7. Crutchfield, J., Feldman, D.: Regularities Unseen, Randomness Observed: Levels of Entropy Convergence. Chaos 13 (2003) 25-54
8. Vlasie, D.: The Very Particular Structure of the Very Hard Instances. In: AAAI/IAAI. Volume 1. (1996) 266-270
9. Ornstein, D.: Bernoulli Shifts with the Same Entropy are Isomorphic. Adv. in Math. 4 (1970) 337-352
10. Walsh, T.: The Constrainedness Knife-Edge. In: AAAI/IAAI. (1998) 406-411
11. Mezard, M., Ricci-Tersenghi, F., Zecchina, R.: Alternative Solutions to Diluted p-Spin Models and Xorsat Problems. Journal of Statistical Physics (2002)
12. Hogg, T.: Which Search Problems are Random? In: Proceedings of AAAI98. (1998)
13. Hogg, T.: Refining the Phase Transitions in Combinatorial Search. Artificial Intelligence 81 (1996) 127-154