scientific article; zbMATH DE number 5547880

MaRDI QIDQ3624064zbMATH OpenFDO

Authors Yong Gao, J. Culberson

Publication date 28 April 2009

Full work available at URL https://arxiv.org/abs/1110.2204

zbMATH Keywords

non-trivial random CSP models

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Principles and Practice of Constraint Programming – CP 2004
• Models for Random Constraint Satisfaction Problems
• Random constraint satisfaction: Flaws and structure
• A general model and thresholds for random constraint satisfaction problems
• Consistency for Quantified Constraint Satisfaction Problems
• scientific article; zbMATH DE number 7301529
• Random constraint satisfaction: A more accurate picture
• scientific article; zbMATH DE number 1002207
• Constraint satisfaction: random regular k-SAT
• Randomized approximation of the constraint satisfaction problem

Cited in

(20)

• Random constraint satisfaction: easy generation of hard (satisfiable) instances
• Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length
• Clustering phase of a general constraint satisfaction problem model \(d\)-\(k\)-CSP
• Large hypertree width for sparse random hypergraphs
• Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration
• Performances of pure random walk algorithms on constraint satisfaction problems with growing domains
• Super solutions of random instances of satisfiability
• Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms
• Extremal CSPs
• A general model and thresholds for random constraint satisfaction problems
• Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search
• Fractional edge cover number of Model RB
• Models for Random Constraint Satisfaction Problems
• A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming
• scientific article; zbMATH DE number 7301529 (Why is no real title available?)
• On the phase transitions of random \(k\)-constraint satisfaction problems
• Principles and Practice of Constraint Programming – CP 2004
• Random constraint satisfaction: A more accurate picture
• Random constraint satisfaction: Flaws and structure
• Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624064)