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

Author： Dantsin E.   Goerdt A.   Hirsch E.A.   Kannan R.   Kleinberg J.   Papadimitriou C.   Raghavan P.   Schoning U.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 69-83

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

GeneticTKM: A Hybrid Clustering Method Based on Genetic Algorithm, Tabu Search and K-Means

By  

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 4, Iss. 1, 2013-01 ,pp. : 67-77

IGI Global_journal

Access to resources Recommend Favorite

Improved search strategies and extensions to k-medoids-based clustering algorithms

By Chu Shu-Chuan   Roddick John F.   Pan Jeng-Shyang  

International Journal of Business Intelligence and Data Mining, Vol. 3, Iss. 2, 2008-09 ,pp. : 212-231

Inderscience Publishers

Access to resources Recommend Favorite

Approximate search algorithm for aggregate k-nearest neighbour queries on remote spatial databases

By Sato Hideki  

International Journal of Knowledge and Web Intelligence, Vol. 4, Iss. 1, 2013-03 ,pp. : 3-19

Inderscience Publishers

Access to resources Recommend Favorite

A queueing model for predicting message latency in uni-directional k-ary n-cubes with deterministic routing and non-uniform traffic

By Loucif Samia   Ould Khaoua Mohamed   Min Geyong  

Cluster Computing, Vol. 10, Iss. 2, 2007-06 ,pp. : 229-239

Springer Publishing Company

Access to resources Recommend Favorite

Multidimensional reverse k NN search

By Tao Yufei  

The VLDB Journal, Vol. 16, Iss. 3, 2007-07 ,pp. : 293-316

Springer Publishing Company

Access to resources Recommend Favorite