Unbiased Statistics of a CSP - A Controlled-Bias Generator

11/17/2011
by   Denis Berthier, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

03/26/2020

No-Rainbow Problem and the Surjective Constraint Satisfaction Problem

Surjective Constraint Satisfaction Problem (SCSP) is the problem of deci...
04/05/2019

The complexity of 3-colouring H-colourable graphs

We study the complexity of approximation on satisfiable instances for gr...
12/07/2020

Improving Constraint Satisfaction Algorithm Efficiency for the AllDifferent Constraint

Combinatorial problems stated as Constraint Satisfaction Problems (CSP) ...
07/27/2020

The Complexity of the Distributed Constraint Satisfaction Problem

We study the complexity of the Distributed Constraint Satisfaction Probl...
02/15/2019

A Comparison of Random Task Graph Generation Methods for Scheduling Problems

How to generate instances with relevant properties and without bias rema...
10/12/2020

Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH

In this paper, we seek a natural problem and a natural distribution of i...
10/10/2011

Consistency and Random Constraint Satisfaction Models

In this paper, we study the possibility of designing non-trivial random ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.