Pages that link to "Item:Q2368999"
From MaRDI portal
The following pages link to Many hard examples in exact phase transitions (Q2368999):
Displaying 28 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)
- 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 random \(k\)-constraint satisfaction problems (Q543632) (← 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)
- Computing the metric dimension of graphs by genetic algorithms (Q849088) (← links)
- An upper (lower) bound for Max (Min) CSP (Q893727) (← links)
- On exponential time lower bound of Knapsack under backtracking (Q964408) (← links)
- Computing minimal doubly resolving sets of graphs (Q1013386) (← links)
- Random constraint satisfaction: easy generation of hard (satisfiable) instances (Q1028939) (← links)
- Threshold behaviors of a random constraint satisfaction problem with exact phase transitions (Q1944183) (← links)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
- On the constraint length of random \(k\)-CSP (Q2352362) (← links)
- Complete Boolean satisfiability solving algorithms based on local search (Q2434568) (← 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)
- Fractional Edge Cover Number of Model RB (Q4632176) (← links)
- Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains (Q4992313) (← links)
- (Q5148942) (← 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)
- Bounding the scaling window of random constraint satisfaction problems (Q5963651) (← links)
