{"id":"https://openalex.org/W4244939413","doi":"https://doi.org/10.1137/1.9781611973105.91","title":"Exponential Lower Bounds for the PPSZ k-SAT Algorithm","display_name":"Exponential Lower Bounds for the PPSZ k-SAT Algorithm","publication_year":2013,"publication_date":"2013-01-06","ids":{"openalex":"https://openalex.org/W4244939413","doi":"https://doi.org/10.1137/1.9781611973105.91"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973105.91","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5003095336","display_name":"Shiteng Chen","orcid":"https://orcid.org/0000-0002-0658-628X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shiteng Chen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034846265","display_name":"Dominik Scheder","orcid":"https://orcid.org/0000-0002-9360-7957"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dominik Scheder","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019353955","display_name":"Navid Talebanfard","orcid":"https://orcid.org/0000-0002-3524-9282"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Navid Talebanfard","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5049161422","display_name":"Bangsheng Tang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bangsheng Tang","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.706,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":4,"citation_normalized_percentile":{"value":0.797259,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":78,"max":80},"biblio":{"volume":null,"issue":null,"first_page":"1253","last_page":"1263"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9975,"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/T12288","display_name":"Optimization and Search Problems","score":0.9975,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9962,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9844,"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/code","display_name":"Code (set theory)","score":0.42320356}],"concepts":[{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.62411433},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5847619},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.50886345},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.48681924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44091752},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43413305},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.42320356},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41168174},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07523391},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973105.91","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4390822878","https://openalex.org/W3212023493","https://openalex.org/W3103304230","https://openalex.org/W2980963558","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W1976691234","https://openalex.org/W1919101720","https://openalex.org/W1882246857"],"abstract_inverted_index":{"Previous":[0,142],"chapter":[1,3,143,145],"Next":[2,144],"Full":[4],"AccessProceedings":[5],"Proceedings":[6],"of":[7],"the":[8,20,71,129],"2013":[9],"Annual":[10],"ACM-SIAM":[11],"Symposium":[12],"on":[13,83,127],"Discrete":[14],"Algorithms":[15],"(SODA)Exponential":[16],"Lower":[17],"Bounds":[18],"for":[19,62,115,137],"PPSZ":[21],"k-SAT":[22],"AlgorithmShiteng":[23],"Chen,":[24,32],"Dominik":[25,33],"Scheder,":[26,34],"Navid":[27,35],"Talebanfard,":[28,36],"and":[29,37,54],"Bangsheng":[30,38],"TangShiteng":[31],"Tangpp.1253":[39],"-":[40],"1263Chapter":[41],"DOI:https://doi.org/10.1137/1.9781611973105.91PDFBibTexSections":[42],"ToolsAdd":[43],"to":[44],"favoritesExport":[45],"CitationTrack":[46],"CitationsEmail":[47],"SectionsAboutAbstract":[48],"In":[49,108],"1998,":[50],"Paturi,":[51],"Pudl\u00e1k,":[52],"Saks,":[53],"Zane":[55],"presented":[56],"PPSZ,":[57],"an":[58],"elegant":[59],"randomized":[60],"algorithm":[61,68],"k-SAT.":[63],"Fourteen":[64],"years":[65],"on,":[66],"this":[67,109],"is":[69,89,133],"still":[70],"fastest":[72],"known":[73],"worst-case":[74],"algorithm.":[75],"They":[76],"proved":[77],"that":[78],"its":[79],"expected":[80,130],"running":[81,131],"time":[82,132],"k-CNF":[84,122],"formulas":[85,123],"with":[86],"n":[87,125],"variables":[88,126],"at":[90,103,134],"most":[91],",":[92,136],"where":[93],"\u03b5k":[94,138],"\u220a":[95,139],"\u03a9(1/k).":[96],"So":[97],"far,":[98],"no":[99],"exponential":[100],"lower":[101],"bounds":[102],"all":[104],"have":[105],"been":[106],"known.":[107],"paper,":[110],"we":[111,119],"construct":[112,120],"hard":[113],"instances":[114],"PPSZ.":[116],"That":[117],"is,":[118],"satisfiable":[121],"over":[124],"which":[128],"least":[135],"O(log2":[140],"k/k).":[141],"RelatedDetails":[146],"Published:2013ISBN:978-1-61197-251-1eISBN:978-1-61197-310-5":[147],"https://doi.org/10.1137/1.9781611973105Book":[148],"Series":[149],"Name:ProceedingsBook":[150],"Code:PR143Book":[151],"Pages:xix":[152],"+":[153],"1915":[154]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4244939413","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2024-12-13T17:44:00.272764","created_date":"2022-05-12"}