The following pages link to (Q4954175):
Displaying 46 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)
- Dealing with satisfiability and \(n\)-ary CSPs in a logical framework (Q438582) (← links)
- Phase transitions of contingent planning problem (Q474510) (← links)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
- A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming (Q507445) (← links)
- On the phase transitions of \((k, q)\)-SAT (Q517195) (← links)
- On the phase transitions of random \(k\)-constraint satisfaction problems (Q543632) (← links)
- Combinatorial sharpness criterion and phase transition classification for random CSPs (Q598196) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
- Statistical regimes across constrainedness regions (Q850446) (← links)
- The scaling window of the model \(d\)-\(k\)-CSP (Q890505) (← links)
- An upper (lower) bound for Max (Min) CSP (Q893727) (← links)
- The SAT-UNSAT transition for random constraint satisfaction problems (Q1025462) (← links)
- Random constraint satisfaction: easy generation of hard (satisfiable) instances (Q1028939) (← links)
- Reasoning from last conflict(s) in constraint programming (Q1045989) (← links)
- On the average similarity degree between solutions of random \(k\)-SAT and random CSPs. (Q1421490) (← links)
- A sharp threshold for a random constraint satisfaction problem (Q1877674) (← links)
- A tighter upper bound for random MAX \(2\)-SAT (Q1944049) (← links)
- Threshold behaviors of a random constraint satisfaction problem with exact phase transitions (Q1944183) (← links)
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
- Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length (Q2111656) (← links)
- Nature-inspired techniques for dynamic constraint satisfaction problems (Q2139357) (← 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)
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
- On the constraint length of random \(k\)-CSP (Q2352362) (← links)
- Many hard examples in exact phase transitions (Q2368999) (← links)
- Complete Boolean satisfiability solving algorithms based on local search (Q2434568) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem (Q3452557) (← links)
- Super Solutions of Random Instances of Satisfiability (Q3452579) (← links)
- A Model to Study Phase Transition and Plateaus in Relational Learning (Q3543267) (← links)
- Sharp thresholds for constraint satisfaction problems and homomorphisms (Q3608298) (← links)
- Fractional Edge Cover Number of Model RB (Q4632176) (← links)
- Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One (Q4632185) (← links)
- Phase Transition for Maximum Not-All-Equal Satisfiability (Q4632221) (← 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)
- On the Minimal Constraint Satisfaction Problem: Complexity and Generation (Q5743544) (← links)
- Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden (Q5881807) (← links)
- Constructing an asymptotic phase transition in random binary constraint satisfaction problems (Q5958810) (← links)
- Bounding the scaling window of random constraint satisfaction problems (Q5963651) (← links)
