An improved deterministic local search algorithm for 3-SAT

Brueggemann, Tobias and Kern, Walter (2004) An improved deterministic local search algorithm for 3-SAT. Theoretical Computer Science, 329 (1-3). pp. 303-313. ISSN 0304-3975

PDF
Restricted to UT campus only: Request a copy
205Kb

Abstract:	We slightly improve the pruning technique presented in Dantsin et al. (Theoret. Comput. Sci. 289 (2002) 69) to obtain an O*(1.473n) deterministic algorithm for 3-SAT.
Item Type:	Article
Copyright:	© 2004 Elsevier
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/76360
Official URL:	http://dx.doi.org/10.1016/j.tcs.2004.08.002
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 219386