{"id":"https://openalex.org/W2221611244","doi":"https://doi.org/10.1090/dimacs/035/06","title":"Worst-case analysis, 3-SAT decision, and lower bounds: Approaches for improved SAT algorithms","display_name":"Worst-case analysis, 3-SAT decision, and lower bounds: Approaches for improved SAT algorithms","publication_year":1997,"publication_date":"1997-12-09","ids":{"openalex":"https://openalex.org/W2221611244","doi":"https://doi.org/10.1090/dimacs/035/06","mag":"2221611244"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/035/06","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/035/06","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5113708376","display_name":"Olivers Kullmann","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Olivers Kullmann","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5113708376"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.3352,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.98290598,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"261","last_page":"313"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.840499997138977,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.840499997138977,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10679","display_name":"Service-Oriented Architecture and Web Services","score":0.8296999931335449,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.828499972820282,"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/computer-science","display_name":"Computer science","score":0.5392820239067078},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5311884880065918}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5392820239067078},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5311884880065918}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1090/dimacs/035/06","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/035/06","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.39.8369","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8369","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.toronto.edu/~kullmann/procfin2e.ps","raw_type":"text"},{"id":"pmh:oai:cronfa.swan.ac.uk:cronfa19385","is_oa":false,"landing_page_url":"https://cronfa.swan.ac.uk/Record/cronfa19385","pdf_url":null,"source":{"id":"https://openalex.org/S4306401612","display_name":"Cronfa (Swansea University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39586589","host_organization_name":"Swansea University","host_organization_lineage":["https://openalex.org/I39586589"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book Chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.699999988079071,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857"],"abstract_inverted_index":{".":[0],"New":[1],"methods":[2],"for":[3,25,37,57,92,126,139,159],"worst-case":[4,87],"analysis":[5,128],"and":[6,44,65,114],"(3-)SAT":[7],"decision":[8,27,39,94],"are":[9,42,74,96,105],"presented.":[10,97],"The":[11,35,111,150],"focus":[12],"lies":[13],"on":[14],"the":[15,20,31,66,80,85,102,115,127,145,160],"central":[16,81],"ideas":[17,82],"leading":[18,83],"to":[19,69,84],"improved":[21,86],"bound":[22,56,73,89,158],"1:5045":[23,90],"n":[24,29,91],"3-SAT":[26,93],"([Ku96];":[28],"is":[30,63,121,153],"number":[32,48,161],"of":[33,49,61,109,117,129,147,162],"variables).":[34],"implications":[36],"SAT":[38,130],"in":[40],"general":[41,59],"discussed":[43],"elucidated":[45],"by":[46],"a":[47,58,118,137],"hypothesis'.":[50],"In":[51,77,99],"addition":[52],"an":[53,156],"exponential":[54],"lower":[55],"class":[60],"SAT-algorithms":[62],"given":[64],"only":[67],"possibilities":[68],"remain":[70],"under":[71],"this":[72,78],"pointed":[75],"out.":[76],"article":[79],"upper":[88,157],"([Ku96])":[95],"1)":[98],"nine":[100],"sections":[101],"following":[103],"subjects":[104],"treated:":[106],"1.":[107],""Gauging":[108],"branchings":":[110],""":[112,151],"-function"":[113],"concept":[116],""distance":[119],"function"":[120],"introduced,":[122],"our":[123],"main":[124],"tools":[125],"algorithms,":[131],"and,":[132],"as":[133],"we":[134],"propose,":[135],"also":[136],"basis":[138],"(complete)":[140],"practical":[141],"algorithms.":[142],"2.":[143],""Estimating":[144],"size":[146],"arbitrary":[148],"trees":":[149],"-Lemma"":[152],"presented,":[154],"yielding":[155],"l...":[163]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}