{"id":"https://openalex.org/W2016042296","doi":"https://doi.org/10.1137/0214067","title":"The Pure Literal Rule and Polynomial Average Time","display_name":"The Pure Literal Rule and Polynomial Average Time","publication_year":1985,"publication_date":"1985-11-01","ids":{"openalex":"https://openalex.org/W2016042296","doi":"https://doi.org/10.1137/0214067","mag":"2016042296"},"language":"en","primary_location":{"id":"doi:10.1137/0214067","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214067","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5030220389","display_name":"Paul W. Purdom","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Paul Walton Purdom, Jr.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5017434173","display_name":"Cynthia A. Brown","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cynthia A. Brown","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030220389"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.0054,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.94610664,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"14","issue":"4","first_page":"943","last_page":"953"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9861000180244446,"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/T11567","display_name":"semigroups and automata theory","score":0.9861000180244446,"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.9747999906539917,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.97079998254776,"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/mathematics","display_name":"Mathematics","score":0.7973576188087463},{"id":"https://openalex.org/keywords/literal","display_name":"Literal (mathematical logic)","score":0.7662627100944519},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7481740713119507},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6680870652198792},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.6391377449035645},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.5426403284072876},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5356763005256653},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4647248387336731},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4623922109603882},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.45224201679229736},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42985960841178894},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.42003077268600464},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2294926941394806},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.078163743019104}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7973576188087463},{"id":"https://openalex.org/C2780882242","wikidata":"https://www.wikidata.org/wiki/Q14235582","display_name":"Literal (mathematical logic)","level":2,"score":0.7662627100944519},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7481740713119507},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6680870652198792},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.6391377449035645},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.5426403284072876},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5356763005256653},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4647248387336731},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4623922109603882},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.45224201679229736},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42985960841178894},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.42003077268600464},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2294926941394806},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.078163743019104},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0214067","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214067","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1550402024","https://openalex.org/W1969377401","https://openalex.org/W1980584633","https://openalex.org/W2022695609","https://openalex.org/W2037712946","https://openalex.org/W2055978814","https://openalex.org/W2057361103","https://openalex.org/W2062897452"],"related_works":["https://openalex.org/W2480084299","https://openalex.org/W3107131366","https://openalex.org/W2039120963","https://openalex.org/W2107860373","https://openalex.org/W2014111643","https://openalex.org/W1557481323","https://openalex.org/W2949936428","https://openalex.org/W2102980637","https://openalex.org/W1578031582","https://openalex.org/W2807072029"],"abstract_inverted_index":{"For":[0],"a":[1,13,48,55,60,84],"simple":[2],"parameterized":[3],"model":[4],"of":[5,16,24,40,45,86,111],"conjunctive":[6],"normal":[7],"form":[8],"predicates,":[9],"we":[10],"show":[11,172],"that":[12,54,90,102,173],"simplified":[14],"version":[15,85],"the":[17,25,28,38,43,52,64,87,95,106,112,147,174,179],"Davis\u2013Putnam":[18,88],"procedure":[19,89],"can,":[20],"for":[21,66,117,151,177,190],"many":[22],"values":[23],"parameters,":[26],"solve":[27],"satisfiability":[29],"problem":[30,107,175,201],"in":[31,47,59,105],"polynomial":[32,104],"average":[33,100],"time.":[34],"Let":[35,69],"v":[36,208],"be":[37,72],"number":[39,44],"variables,":[41],"$t(v)$":[42,204],"clauses":[46],"predicate,":[49],"and":[50,77,94,154,161,209],"$p(v)$":[51,211],"probability":[53],"given":[56],"literal":[57,97,181],"appears":[58],"clause":[61],"($p(v)$":[62],"is":[63,103],"same":[65],"all":[67],"literals).":[68],"$\\varepsilon":[70],"$":[71,218],"any":[73,79,110],"small":[74],"positive":[75,81],"constant":[76],"n":[78,140],"large":[80,118],"integer.":[82],"Then":[83],"uses":[91,99],"only":[92],"backtracking":[93,192],"pure":[96,180],"rule":[98,182],"time":[101],"size":[108],"when":[109],"following":[113],"conditions":[114],"are":[115,185,219],"true":[116],"v.":[119],"(1)":[120,153],"$t(v)":[121,126,157],"\\leqq":[122,139,158,163],"n\\ln":[123],"v$;":[124],"(2)":[125],"\\geqq":[127,133],"\\exp":[128,164],"(\\varepsilon":[129],"v)$;":[130],"(3)":[131],"$p(v)":[132,138,162],"\\varepsilon":[134],"$;":[135],"or":[136],"(4)":[137,155],"(\\ln":[141],"v/":[142],"v)^{3/2}":[143],"$.":[144],"Until":[145],"recently":[146],"best":[148],"previous":[149],"bounds":[150],"cases":[152],"were":[156],"(\\ln\\ln":[159],"v)/(\\ln3)$":[160],"(":[165],"-":[166,216],"v\\ln":[167],"\\ln":[168],"v)$.":[169],"These":[170],"results":[171],"types":[176],"which":[178,191],"works":[183,193],"well":[184],"quite":[186],"different":[187],"from":[188],"those":[189],"well.":[194],"Our":[195],"present":[196],"knowledge":[197],"suggests":[198],"this":[199],"random":[200],"sets":[202],"with":[203,210],"somewhat":[205,212],"larger":[206,213],"than":[207,214],"$v^{":[215],"1}":[217],"particularly":[220],"difficult":[221],"to":[222],"solve.":[223]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}