Pages that link to "Item:Q1028939"

The following pages link to Random constraint satisfaction: easy generation of hard (satisfiable) instances (Q1028939):

Displaying 43 items.

• Performances of pure random walk algorithms on constraint satisfaction problems with growing domains (Q328683) (← links)
• A general model and thresholds for random constraint satisfaction problems (Q359981) (← links)
• STR2: optimized simple tabular reduction for table constraints (Q429802) (← links)
• A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming (Q507445) (← links)
• On the phase transitions of random \(k\)-constraint satisfaction problems (Q543632) (← links)
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
• Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
• The scaling window of the model \(d\)-\(k\)-CSP (Q890505) (← links)
• An upper (lower) bound for Max (Min) CSP (Q893727) (← links)
• On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
• Reasoning from last conflict(s) in constraint programming (Q1045989) (← links)
• On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
• Threshold behaviors of a random constraint satisfaction problem with exact phase transitions (Q1944183) (← links)
• Incomplete inference for graph problems (Q1947627) (← links)
• Weight-based heuristics for constraint satisfaction and combinatorial optimization problems (Q1951176) (← links)
• Pareto optimization for subset selection with dynamic cost constraints (Q2060721) (← links)
• A study on sequential minimal optimization methods for standard quadratic problems (Q2095525) (← links)
• Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length (Q2111656) (← links)
• An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
• Clustering phase of a general constraint satisfaction problem model \(d\)-\(k\)-CSP (Q2164572) (← links)
• SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
• From MDD to BDD and arc consistency (Q2331100) (← links)
• STR3: a path-optimal filtering algorithm for table constraints (Q2341830) (← links)
• Optimal and efficient filtering algorithms for table constraints (Q2342592) (← links)
• Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
• On the constraint length of random \(k\)-CSP (Q2352362) (← links)
• A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
• Complete Boolean satisfiability solving algorithms based on local search (Q2434568) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism (Q2680785) (← links)
• PHASE TRANSITIONS OF EXPSPACE-COMPLETE PROBLEMS: A FURTHER STEP (Q2909190) (← links)
• NEW WORST-CASE UPPER BOUND FOR COUNTING EXACT SATISFIABILITY (Q2941085) (← links)
• Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
• Super Solutions of Random Instances of Satisfiability (Q3452579) (← links)
• A Model to Study Phase Transition and Plateaus in Relational Learning (Q3543267) (← links)
• Fractional Edge Cover Number of Model RB (Q4632176) (← links)
• Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains (Q4992313) (← links)
• The solution space structure of planted constraint satisfaction problems with growing domains (Q5066057) (← links)
• Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← links)
• Constructing concrete hard instances of the maximum independent set problem (Q5149679) (← links)
• Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden (Q5881807) (← links)
• Bounding the scaling window of random constraint satisfaction problems (Q5963651) (← links)
• Maximum independent sets and supervised learning (Q6151016) (← links)