A probabilistic analysis of randomly generated binary constraint satisfaction problems.
type: Item
instance of: scholarly article
title: A probabilistic analysis of randomly generated binary constraint satisfaction problems.
zbMATH Open document ID: 1055.68102
DOI: 10.1016/S0304-3975(02)00317-1
author: D. Massart
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 1965235
Wikidata QID: Q56323957
MaRDI profile type: Publication
cites work: The asymptotic number of labeled graphs with given degree sequences
cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
cites work: A Sufficient Condition for Backtrack-Free Search
cites work: Q4519896
cites work: Sudden emergence of a giant \(k\)-core in a random graph
full work available at URL: s0304-3975(02)00317-1
OpenAlex ID: W2013181989
DBLP publication ID: journals/tcs/DyerFM03
Recommended article: The satisfiability threshold for randomly generated binary constraint satisfaction problems
Recommended article: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Recommended article: Theory and Applications of Satisfiability Testing
Recommended article: GA performance distributions and randomly generated binary constraint satisfaction problems.
Recommended article: A general model and thresholds for random constraint satisfaction problems
Recommended article: A probabilistic study on the satisfiability problem
Recommended article: Q3081621
Recommended article: Models for Random Constraint Satisfaction Problems
Recommended article: Q3129925
Recommended article: Q4411392
description: scientific article; zbMATH DE number 1965235