Unbiased Statistics of a CSP - A Controlled-Bias Generator

Abstract : We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two aspects of the problem: defining a measure of complexity and generating random unbiased instances. For the first problem, we rely on a general framework and a measure of complexity we presented at CISSE08. For the generation problem, we restrict our analysis to the Sudoku example and we provide a solution that also explains why it is so difficult.
Document type :
Book sections
Khaled Elleithy. Innovations in Computing Sciences and Software Engineering, Springer, pp.165-170, 2010


https://hal.archives-ouvertes.fr/hal-00641955
Contributor : Denis Berthier <>
Submitted on : Thursday, November 17, 2011 - 7:39:38 AM
Last modification on : Thursday, November 17, 2011 - 2:15:30 PM

Files

Berthier-CSP-UStats-V4.pdf
fileSource_public_author

Identifiers

  • HAL Id : hal-00641955, version 1
  • ARXIV : 1111.4083

Collections

Citation

Denis Berthier. Unbiased Statistics of a CSP - A Controlled-Bias Generator. Khaled Elleithy. Innovations in Computing Sciences and Software Engineering, Springer, pp.165-170, 2010. <hal-00641955>

Export

Share

Metrics

Consultation de
la notice

386

Téléchargement du document

61