{"id":"https://openalex.org/W2952270385","doi":"https://doi.org/10.1145/3313276.3316359","title":"Faster <i>k</i> -SAT algorithms using biased-PPSZ","display_name":"Faster <i>k</i> -SAT algorithms using biased-PPSZ","publication_year":2019,"publication_date":"2019-06-20","ids":{"openalex":"https://openalex.org/W2952270385","doi":"https://doi.org/10.1145/3313276.3316359","mag":"2952270385"},"language":"en","primary_location":{"id":"doi:10.1145/3313276.3316359","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3313276.3316359","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-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/A5049011416","display_name":"Thomas Dueholm Hansen","orcid":null},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Thomas Dueholm Hansen","raw_affiliation_strings":["University of Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006699796","display_name":"Haim Kaplan","orcid":"https://orcid.org/0000-0001-9586-8002"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Haim Kaplan","raw_affiliation_strings":["Tel Aviv University, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048299120","display_name":"Or Zamir","orcid":"https://orcid.org/0000-0003-4908-878X"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Or Zamir","raw_affiliation_strings":["Tel Aviv University, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005525211","display_name":"Uri Zwick","orcid":"https://orcid.org/0000-0002-7638-7710"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Uri Zwick","raw_affiliation_strings":["Tel Aviv University, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5049011416"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":4.1907,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.94621336,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"578","last_page":"589"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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.9965999722480774,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6416423320770264},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6051862239837646}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6416423320770264},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6051862239837646}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3313276.3316359","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3313276.3316359","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/ac251729-641b-4ed4-929b-11b1501cd700","is_oa":false,"landing_page_url":"https://curis.ku.dk/portal/da/publications/faster-ksat-algorithms-using-biasedppsz(ac251729-641b-4ed4-929b-11b1501cd700).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hansen , T D , Kaplan , H , Zamir , O & Zwick , U 2019 , Faster k-SAT algorithms using biased-PPSZ . in STOC: ACM Symposium on Theory of Computing . Association for Computing Machinery , pp. 578-589 , the 51st Annual ACM SIGACT Symposium , 23/06/2019 . https://doi.org/10.1145/3313276.3316359","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:publications/ac251729-641b-4ed4-929b-11b1501cd700","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/ac251729-641b-4ed4-929b-11b1501cd700","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hansen , T D , Kaplan , H , Zamir , O & Zwick , U 2019 , Faster k-SAT algorithms using biased-PPSZ . in STOC: ACM Symposium on Theory of Computing . Association for Computing Machinery , pp. 578-589 , the 51st Annual ACM SIGACT Symposium , 23/06/2019 . https://doi.org/10.1145/3313276.3316359","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2871243471","display_name":null,"funder_award_id":"1841/14","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G4422840520","display_name":null,"funder_award_id":"16582","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320312914","display_name":"Blavatnik Family Foundation","ror":null},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W282603215","https://openalex.org/W1518117504","https://openalex.org/W1985572324","https://openalex.org/W2002838007","https://openalex.org/W2014111643","https://openalex.org/W2036265926","https://openalex.org/W2049136377","https://openalex.org/W2082757215","https://openalex.org/W2180459618","https://openalex.org/W2767659766","https://openalex.org/W2963722463","https://openalex.org/W4255529553"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"The":[0],"PPSZ":[1,29,41,50],"algorithm,":[2],"due":[3],"to":[4,88],"Paturi,":[5],"Pudlak,":[6],"Saks":[7],"and":[8,63],"Zane,":[9],"is":[10],"currently":[11],"the":[12,17,40,83],"fastest":[13],"known":[14],"algorithm":[15,42],"for":[16,20,51,78],"k-SAT":[18],"problem,":[19],"every":[21,52],"k>3.":[22],"For":[23,55],"3-SAT,":[24,80],"a":[25,36,65],"tiny":[26],"improvement":[27,48,69],"over":[28,49,70],"was":[30],"obtained":[31],"by":[32],"Hertli.":[33],"We":[34],"introduce":[35],"biased":[37],"version":[38],"of":[39],"using":[43],"which":[44],"we":[45,57,81],"obtain":[46],"an":[47],"k\u2265":[53],"3.":[54],"k=3":[56],"also":[58],"improve":[59,82],"on":[60],"Herli\u2019s":[61],"result":[62],"get":[64],"much":[66],"more":[67],"noticeable":[68],"PPSZ,":[71],"though":[72],"still":[73],"relatively":[74],"small.":[75],"In":[76],"particular,":[77],"Unique":[79],"current":[84],"bound":[85],"from":[86],"1.308n":[87],"1.307n.":[89]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}