On the constraint length of random k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}-CSP

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Journal of combinatorial optimization

• Publication date

  2014-04-04

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10878-014-9731-3
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Note on Random k-SAT for Moderately Growing k

  2012influential reference
• On the phase transitions of random k-constraint satisfaction problems

  2011influential reference
• Formula dissection: A parallel algorithm for constraint satisfaction

  2008cited by this paper
• Random constraint satisfaction: Easy generation of hard (satisfiable) instances

  2007cited by this paper
• Random k-Sat: A Tight Threshold For Moderately Growing k

  2005cited by this paper
• Many hard examples in exact phase transitions

  2003cited by this paper
• Random kSAT : A tight threshold for moderately growing k

  2002cited by this paper
• Exact Phase Transitions in Random Constraint Satisfaction Problems

  2000cited by this paper
• Finding Hard Instances of the Satissability Problem: a Survey

  1997cited by this paper
• Random Constraint Satisfaction: A More Accurate Picture

  1997cited by this paper
• Finding hard instances of the satisfiability problem: A survey

  1996cited by this paper
• Random Constraint Satisfaction a More Accurate Picture

  year unknowncited by this paper

• The Clustering Phase Transition of Random Mixed Constraint Satisfaction Problem

  2025cites this paper
• Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length

  2022cites this paper
• Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains

  2021cites this paper
• On the Lower Bounds of (1, 0)-Super Solutions for Random k-SAT

  2019cites this paper
• The scaling window of the model d-k-CSP

  2016cites this paper
• Performances of pure random walk algorithms on constraint satisfaction problems with growing domains

  2015cites this paper
• Bounding the scaling window of random constraint satisfaction problems

  2014cites this paper