{"id":"https://openalex.org/W2149719182","doi":"https://doi.org/10.1007/s10817-005-9006-x","title":"Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas","display_name":"Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas","publication_year":2006,"publication_date":"2006-08-14","ids":{"openalex":"https://openalex.org/W2149719182","doi":"https://doi.org/10.1007/s10817-005-9006-x","mag":"2149719182"},"language":"en","primary_location":{"id":"doi:10.1007/s10817-005-9006-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10817-005-9006-x","pdf_url":null,"source":{"id":"https://openalex.org/S99781599","display_name":"Journal of Automated Reasoning","issn_l":"0168-7433","issn":["0168-7433","1573-0670"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Automated Reasoning","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/A5108192310","display_name":"Michael Alekhnovich","orcid":null},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Alekhnovich","raw_affiliation_strings":["Institute for Advanced Study, Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study, Princeton, NJ, USA","institution_ids":["https://openalex.org/I40036882"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035077817","display_name":"Edward Hirsch","orcid":null},"institutions":[{"id":"https://openalex.org/I2800906181","display_name":"St. Petersburg Department of Steklov Institute of Mathematics","ror":"https://ror.org/030h9s280","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2800906181","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Edward A. Hirsch","raw_affiliation_strings":["St. Petersburg Department of Steklov, Institute of Mathematics, St. Petersburg, 191011, Russia"],"affiliations":[{"raw_affiliation_string":"St. Petersburg Department of Steklov, Institute of Mathematics, St. Petersburg, 191011, Russia","institution_ids":["https://openalex.org/I2800906181"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015046471","display_name":"Dmitry Itsykson","orcid":"https://orcid.org/0000-0003-2680-4800"},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Dmitry Itsykson","raw_affiliation_strings":["Faculty of Mathematics and Mechanics, St. Petersburg State University, St. Petersburg, Russia"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Mechanics, St. Petersburg State University, St. Petersburg, Russia","institution_ids":["https://openalex.org/I172901346"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108192310"],"corresponding_institution_ids":["https://openalex.org/I40036882"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.8323,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.94034856,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"35","issue":"1-3","first_page":"51","last_page":"72"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"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.9991000294685364,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9921000003814697,"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/dpll-algorithm","display_name":"DPLL algorithm","score":0.9665131568908691},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7111716270446777},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6800543665885925},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.6541451215744019},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6513914465904236},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.5645526647567749},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.5449813604354858},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5275116562843323},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5243791937828064},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5036429762840271},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4661819636821747},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.45198217034339905},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4353104531764984},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4306222200393677},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38320910930633545},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27388304471969604},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.11355891823768616}],"concepts":[{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.9665131568908691},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7111716270446777},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6800543665885925},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.6541451215744019},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6513914465904236},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.5645526647567749},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.5449813604354858},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5275116562843323},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5243791937828064},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5036429762840271},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4661819636821747},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.45198217034339905},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4353104531764984},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4306222200393677},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38320910930633545},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27388304471969604},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.11355891823768616},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10817-005-9006-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10817-005-9006-x","pdf_url":null,"source":{"id":"https://openalex.org/S99781599","display_name":"Journal of Automated Reasoning","issn_l":"0168-7433","issn":["0168-7433","1573-0670"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Automated Reasoning","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W206140123","https://openalex.org/W1500660230","https://openalex.org/W1518031539","https://openalex.org/W1979753555","https://openalex.org/W1988434420","https://openalex.org/W2001495051","https://openalex.org/W2033901233","https://openalex.org/W2057361103","https://openalex.org/W2062671967","https://openalex.org/W2062897452","https://openalex.org/W2084384424","https://openalex.org/W2101017768","https://openalex.org/W2110053319","https://openalex.org/W2131459042","https://openalex.org/W2133527541","https://openalex.org/W2133941356","https://openalex.org/W2143404729","https://openalex.org/W4246708745","https://openalex.org/W6682496146","https://openalex.org/W6823982362"],"related_works":["https://openalex.org/W2061097805","https://openalex.org/W2394349251","https://openalex.org/W2480084299","https://openalex.org/W3107131366","https://openalex.org/W2014111643","https://openalex.org/W3136261533","https://openalex.org/W3128448798","https://openalex.org/W2235115558","https://openalex.org/W1608133301","https://openalex.org/W1573666268"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}