{"id":"https://openalex.org/W2012948111","doi":null,"title":"On the possibility of faster SAT algorithms","display_name":"On the possibility of faster SAT algorithms","publication_year":2010,"publication_date":"2010-03-13","ids":{"openalex":"https://openalex.org/W2012948111","mag":"2012948111"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.156.3318","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.3318","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~ryanw/cnf-sat-feasible.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5111909002","display_name":"Mihai P\u01cetra\u015fcu","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mihai Patrascu","raw_affiliation_strings":["AT&T Labs., Florham Park, NJ#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs., Florham Park, NJ#TAB#","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063871533","display_name":"Ryan Williams","orcid":"https://orcid.org/0000-0003-2326-2233","observed_orcids":["https://orcid.org/0000-0003-2326-2233"]},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ryan Williams","raw_affiliation_strings":["IBM Almaden Research Center San Jose , CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Almaden Research Center San Jose , CA","institution_ids":["https://openalex.org/I4210085935"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":16.2456,"has_fulltext":false,"cited_by_count":164,"citation_normalized_percentile":{"value":0.99566761,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5547000169754028,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5547000169754028,"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.4325999915599823,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.007300000172108412,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/k-dominating-sets","display_name":"k-dominating sets","score":0.7440000176429749},{"id":"https://openalex.org/keywords/2-sat","display_name":"2-SAT","score":0.9580000042915344},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"communication complexity","score":0.6000000238418579},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.6079999804496765},{"id":"https://openalex.org/keywords/reduction","display_name":"reduction","score":0.37700000405311584}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6897585988044739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5947636365890503},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5889332294464111},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5263261198997498},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.5149458050727844},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.5069749355316162},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5025317668914795},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4649433195590973},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4518609941005707},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45142239332199097},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4391346871852875},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.432813823223114},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4249202013015747},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4180343747138977},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4130239188671112},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4047068655490875},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.156.3318","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.3318","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~ryanw/cnf-sat-feasible.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.173.7487","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.173.7487","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/mip/papers/sat-lbs/paper.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.215.3409","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.3409","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.siam.org/proceedings/soda/2010/SODA10_086_patrascum.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W13796393","https://openalex.org/W37923608","https://openalex.org/W104109059","https://openalex.org/W189633613","https://openalex.org/W301824129","https://openalex.org/W1500953391","https://openalex.org/W1504650505","https://openalex.org/W1513451900","https://openalex.org/W1581049064","https://openalex.org/W1582552841","https://openalex.org/W1593916827","https://openalex.org/W1646807396","https://openalex.org/W1709155369","https://openalex.org/W1973113631","https://openalex.org/W1979740015","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2004472922","https://openalex.org/W2011039300","https://openalex.org/W2011992362","https://openalex.org/W2014917736","https://openalex.org/W2031823362","https://openalex.org/W2067983896","https://openalex.org/W2074564146","https://openalex.org/W2089311600","https://openalex.org/W2107351840","https://openalex.org/W2111829945","https://openalex.org/W2130190334","https://openalex.org/W2135364550","https://openalex.org/W2136083928","https://openalex.org/W2150123893","https://openalex.org/W2159892713","https://openalex.org/W2172507717","https://openalex.org/W2752885492","https://openalex.org/W2913688336"],"related_works":["https://openalex.org/W2588261353","https://openalex.org/W7098684885","https://openalex.org/W322155389","https://openalex.org/W2268208042","https://openalex.org/W1988939260","https://openalex.org/W4298521764","https://openalex.org/W207488477","https://openalex.org/W2110067376","https://openalex.org/W1668201777","https://openalex.org/W7202243844"],"abstract_inverted_index":{"We":[0,20],"describe":[1],"reductions":[2,113],"from":[3],"the":[4,8,26,31,34,118],"problem":[5],"of":[6,10,25,33,65,120,130],"determining":[7],"satisfiability":[9],"Boolean":[11],"CNF":[12],"formulas":[13],"(CNF-SAT)":[14],"to":[15],"several":[16],"natural":[17],"algorithmic":[18],"problems.":[19],"show":[21],"that":[22],"attaining":[23],"any":[24,49],"following":[27],"bounds":[28,125],"would":[29],"improve":[30],"state":[32],"art":[35],"in":[36],"algorithms":[37],"for":[38,45,48,58,72,79,102],"SAT:":[39],"\u2022":[40,53,67,74,95],"an":[41,68,75,96],"O(n":[42,76],"k\u2212\u03b5)":[43,100],"algorithm":[44,71,78,101],"k-Dominating":[46],"Set,":[47],"k":[50,105],"\u2265":[51],"3,":[52],"a":[54],"(computationally":[55],"efficient)":[56],"protocol":[57],"3-party":[59],"set":[60],"disjointness":[61],"with":[62,81,104],"o(m)":[63],"bits":[64],"communication,":[66],"n":[69,84],"o(d)":[70],"d-SUM,":[73],"2\u2212\u03b5)":[77],"2-SAT":[80],"m":[82],"=":[83],"1+o(1)":[85],"clauses,":[86],"where":[87],"two":[88],"clauses":[89],"may":[90,110],"have":[91],"unrestricted":[92,106],"length,":[93],"and":[94],"O((n":[97],"+":[98],"m)":[99],"HornSat":[103],"length":[107],"clauses.":[108],"One":[109],"interpret":[111],"our":[112],"as":[114],"new":[115],"attacks":[116],"on":[117,127],"complexity":[119],"SAT,":[121],"or":[122],"sharp":[123],"lower":[124],"conditional":[126],"exponential":[128],"hardness":[129],"SAT.":[131]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":19},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":21},{"year":2014,"cited_by_count":18},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":10}],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2016-06-24T00:00:00"}