CSP problems as algorithmic benchmarks: measures, methods and models 

Mateu Piñol, Carles (Date of defense: 2009-01-30)

On Computer Science research, traditionally, most efforts have been devoted to research hardness for the worst case of problems (proving NP completeness and comparing and reducing problems between them are the two most ...