Pages that link to "Item:Q1977754"
From MaRDI portal
The following pages link to SAT local search algorithms: Worst-case study (Q1977754):
Displaying 14 items.
- Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas (Q862399) (← links)
- Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings (Q862408) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- Local search algorithms for SAT: an empirical evaluation (Q1581848) (← links)
- The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- Hard satisfiable instances for DPLL-type algorithms (Q2577593) (← links)
- Local search algorithms for SAT: an empirical evaluation (Q2749854) (← links)
- SAT local search algorithms: Worst-case study (Q2749857) (← links)
- A Theoretical Analysis of Search in GSAT (Q3637172) (← links)
- Local search algorithms for SAT: Worst-case analysis (Q5054860) (← links)
- Experimental Study of the Shortest Reset Word of Random Automata (Q5200075) (← links)
- Theory and Applications of Satisfiability Testing (Q5713718) (← links)
