scientific article
From MaRDI portal
Publication:3624064
zbMath1182.68239arXiv1110.2204MaRDI QIDQ3624064
Publication date: 28 April 2009
Full work available at URL: https://arxiv.org/abs/1110.2204
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability ⋮ Super Solutions of Random Instances of Satisfiability ⋮ Performances of pure random walk algorithms on constraint satisfaction problems with growing domains ⋮ Clustering phase of a general constraint satisfaction problem model \(d\)-\(k\)-CSP ⋮ A general model and thresholds for random constraint satisfaction problems ⋮ Random Instances of W[2-Complete Problems: Thresholds, Complexity, and Algorithms] ⋮ Fractional Edge Cover Number of Model RB ⋮ A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming ⋮ On the phase transitions of random \(k\)-constraint satisfaction problems ⋮ Large hypertree width for sparse random hypergraphs ⋮ Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length
This page was built for publication:
