A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search - Concepedia

Concepedia

Publication | Closed Access

A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search

227

Citations

13

References

2002

Year

Evgeny Dantsin, Andreas Goerdt, Edward Hirsch, Ravi Kannan, Jon Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning

Theoretical Computer Science

Local SearchEngineeringLocal Search (Optimization)Data MiningAlgorithm DesignSat SolvingComputational ComplexityComputer ScienceDiscrete MathematicsCombinatorial OptimizationSatisfiabilityVariable Neighborhood Search

References

	Year	Citations

Page 1

Page 1