{"id":"https://openalex.org/W2171680292","doi":"https://doi.org/10.1016/s0304-3975(01)00174-8","title":"A deterministic (2\u22122/(k+1))n algorithm for k-SAT based on local search","display_name":"A deterministic (2\u22122/(k+1))n algorithm for k-SAT based on local search","publication_year":2002,"publication_date":"2002-10-01","ids":{"openalex":"https://openalex.org/W2171680292","doi":"https://doi.org/10.1016/s0304-3975(01)00174-8","mag":"2171680292"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(01)00174-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00174-8","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020126431","display_name":"Evgeny Dantsin","orcid":"https://orcid.org/0000-0002-8753-0279"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Evgeny Dantsin","raw_affiliation_strings":["Department of Computer Science, University of Manchester, Oxford Road, M13 9PL, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Manchester, Oxford Road, M13 9PL, UK","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044686377","display_name":"Andreas Goerdt","orcid":null},"institutions":[{"id":"https://openalex.org/I2610724","display_name":"Chemnitz University of Technology","ror":"https://ror.org/00a208s56","country_code":"DE","type":"education","lineage":["https://openalex.org/I2610724"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Goerdt","raw_affiliation_strings":["TU Chemnitz, Fakult\u00e4t f\u00fcr Informatik, 09107 Chemnitz, Germany"],"affiliations":[{"raw_affiliation_string":"TU Chemnitz, Fakult\u00e4t f\u00fcr Informatik, 09107 Chemnitz, Germany","institution_ids":["https://openalex.org/I2610724"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035077817","display_name":"Edward Hirsch","orcid":null},"institutions":[{"id":"https://openalex.org/I2801160905","display_name":"Steklov Mathematical Institute","ror":"https://ror.org/03zeg8w71","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2801160905","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Edward A Hirsch","raw_affiliation_strings":["Steklov Institute of Mathematics, 27 Fontanka, 191011 St. Petersburg, Russia"],"affiliations":[{"raw_affiliation_string":"Steklov Institute of Mathematics, 27 Fontanka, 191011 St. Petersburg, Russia","institution_ids":["https://openalex.org/I2801160905"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059436381","display_name":"Ravi Kannan","orcid":null},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ravi Kannan","raw_affiliation_strings":["Department of Computer Science, Yale University, New Haven CT 06520, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yale University, New Haven CT 06520, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055710645","display_name":"Jon Kleinberg","orcid":"https://orcid.org/0000-0002-1929-2512"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jon Kleinberg","raw_affiliation_strings":["Department of Computer Science, Cornell University, Ithaca NY 14853, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Cornell University, Ithaca NY 14853, USA","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104056982","display_name":"Christos H. Papadimitriou","orcid":"https://orcid.org/0009-0004-6462-2316"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christos Papadimitriou","raw_affiliation_strings":["Computer Science Division, Soda Hall, UC Berkeley, CA 94720, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Division, Soda Hall, UC Berkeley, CA 94720, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078491738","display_name":"Prabhakar Raghavan","orcid":"https://orcid.org/0000-0001-9853-7604"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Prabhakar Raghavan","raw_affiliation_strings":["Verity Inc., 892 Ross Drive, Sunnyvale CA 94089, USA"],"affiliations":[{"raw_affiliation_string":"Verity Inc., 892 Ross Drive, Sunnyvale CA 94089, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055009733","display_name":"Uwe Sch\u00f6ning","orcid":null},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Uwe Sch\u00f6ning","raw_affiliation_strings":["Universit\u00e4t Ulm, Abteilung Theoretische Informatik, 89069 Ulm, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Ulm, Abteilung Theoretische Informatik, 89069 Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":8,"corresponding_author_ids":["https://openalex.org/A5035077817"],"corresponding_institution_ids":["https://openalex.org/I2801160905"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":14.319,"has_fulltext":false,"cited_by_count":229,"citation_normalized_percentile":{"value":0.99047202,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"289","issue":"1","first_page":"69","last_page":"83"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5995116829872131},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5709710717201233},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5479129552841187},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5414974093437195},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5363340377807617},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.503243625164032},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.49892282485961914},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.46067437529563904},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4479038715362549},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41659823060035706},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39774423837661743}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5995116829872131},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5709710717201233},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5479129552841187},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5414974093437195},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5363340377807617},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.503243625164032},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.49892282485961914},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.46067437529563904},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4479038715362549},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41659823060035706},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39774423837661743},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s0304-3975(01)00174-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00174-8","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.29.1550","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.1550","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://simon.cs.cornell.edu/home/kleinber/sat.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.88.4906","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.4906","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.roosevelt.edu/~dantsin/pdf/DGH+02.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W18803657","https://openalex.org/W649378622","https://openalex.org/W1480235131","https://openalex.org/W1491766353","https://openalex.org/W1500660230","https://openalex.org/W1508239681","https://openalex.org/W1564428908","https://openalex.org/W1667614912","https://openalex.org/W1820801893","https://openalex.org/W1920638964","https://openalex.org/W1990313671","https://openalex.org/W2001013631","https://openalex.org/W2014111643","https://openalex.org/W2036350017","https://openalex.org/W2066749637","https://openalex.org/W2087662271","https://openalex.org/W2121766240","https://openalex.org/W2126442135","https://openalex.org/W2134514766","https://openalex.org/W2221611244","https://openalex.org/W2947000318","https://openalex.org/W6637229586","https://openalex.org/W6689005351"],"related_works":["https://openalex.org/W2174440985","https://openalex.org/W2952453143","https://openalex.org/W2112526268","https://openalex.org/W1964089073","https://openalex.org/W2011643166","https://openalex.org/W4243213822","https://openalex.org/W2279830512","https://openalex.org/W2119226317","https://openalex.org/W1638454426","https://openalex.org/W2526609438"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}