[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_277":278},"routes/_layout",{"_11":197},"routes/entity.$type.$id",{"_11":12,"_13":14,"_15":16,"_17":18,"_19":20,"_21":22,"_23":24,"_25":26,"_27":28},"dehydratedState",{"_73":74,"_75":76},"type","paper","id","paper_W2049136377","section","articles","entity",{"_15":16,"_29":30,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":38,"_39":-5,"_40":41,"_42":43,"_44":45,"_46":47,"_48":-5,"_49":50,"_51":30,"_52":53,"_54":55,"_56":57,"_58":59,"_60":61,"_62":-5,"_63":64,"_65":-5,"_66":67,"_68":30,"_69":-5},"canonical","https://www.hugmap.com/entity/paper/paper_W2049136377/articles","siteBaseUrl","https://www.hugmap.com","sectionCount",0,"jsonLd","{\"@context\":\"https://schema.org\",\"@graph\":[{\"name\":\"An improved exponential-time algorithm for k -SAT\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W2049136377/articles\",\"@type\":\"ScholarlyArticle\",\"headline\":\"An improved exponential-time algorithm for k -SAT\",\"datePublished\":\"2005-05-01\",\"isPartOf\":{\"@type\":\"Periodical\",\"name\":\"Journal of the ACM\"}},{\"@type\":\"CollectionPage\",\"name\":\"An improved exponential-time algorithm for k -SAT 相关文章\",\"description\":\"An improved exponential-time algorithm for k -SAT 在 HugMap 中的相关文章，含结构化关联信息与详情链接。\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W2049136377/articles\",\"inLanguage\":\"zh-CN\"},{\"@type\":\"BreadcrumbList\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"首页\",\"item\":\"https://www.hugmap.com/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"论文\",\"item\":\"https://www.hugmap.com/search?type=paper\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"An improved exponential-time algorithm for k -SAT\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W2049136377\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"相关文章\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W2049136377/articles\"}]}]}","name","An improved exponential-time algorithm for k -SAT","nameZh","aliases","description","descriptionZh","status","active","externalIds","{\"openalex\":\"W2049136377\",\"doi\":\"10.1145/1066100.1066101\"}","properties","source","openalex","createdAt","2026-05-23T12:16:11.237354685","updatedAt","2026-05-23T12:16:11.237356394","doi","10.1145/1066100.1066101","arxivId","openalexId","W2049136377","title","abstractText","We propose and analyze a simple new randomized algorithm, called ResolveSat, for finding satisfying assignments of Boolean formulas in conjunctive normal form. The algorithm consists of two stages: a preprocessing stage in which resolution is applied to enlarge the set of clauses of the formula, followed by a search stage that uses a simple randomized greedy procedure to look for a satisfying assignment. Currently, this is the fastest known probabilistic algorithm for k -CNF satisfiability for k ≥ 4 (with a running time of O (2 0.5625 n ) for 4-CNF). In addition, it is the fastest known probabilistic algorithm for k -CNF, k ≥ 3, that have at most one satisfying assignment (unique k -SAT) (with a running time O (2 (2 ln 2 − 1) n + o ( n ) ) = O (2 0.386 … n ) in the case of 3-CNF). The analysis of the algorithm also gives an upper bound on the number of the codewords of a code defined by a k -CNF. This is applied to prove a lower bounds on depth 3 circuits accepting codes with nonconstant distance. In particular we prove a lower bound Ω(2 1.282…√>i<n>/i< ) for an explicitly given Boolean function of n variables. This is the first such lower bound that is asymptotically bigger than 2 √>i<n>/i< + o (√>i<n>/i<) .","publishedDate","2005-05-01","publishedYear",2005,"venue","Journal of the ACM","citationCount",215,"authors","keywords",[70,71,72],"pdfUrl","topVenue",false,"displayName","displayDescription","semigroups and automata theory","Constraint Satisfaction and Optimization","Advanced Graph Theory Research","mutations",[],"queries",[77],{"_78":79,"_80":81,"_82":83,"_84":85},"dehydratedAt",1781054975146,"state",{"_87":88,"_89":90,"_91":79,"_92":-5,"_93":26,"_94":26,"_95":26,"_96":-5,"_97":-5,"_98":67,"_35":99,"_100":101},"queryKey",[86,19,14,16],"queryHash","[\"portal\",\"entity\",\"paper\",\"paper_W2049136377\"]","portal","data",{"_19":20,"_102":103,"_104":105,"_106":107,"_18":108,"_109":110,"_62":111},"dataUpdateCount",1,"dataUpdatedAt","error","errorUpdateCount","errorUpdatedAt","fetchFailureCount","fetchFailureReason","fetchMeta","isInvalidated","success","fetchStatus","idle","entityType","Paper","taxonomies",[165,166,167],"events",[],[],"technologies",[150],[112,113,114,115],{"_15":145,"_29":146,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":147,"_39":-5,"_40":41,"_42":148,"_44":149,"_121":-5,"_51":-5,"_122":-5,"_123":-5,"_124":-5,"_60":-5,"_125":-5,"_126":-5,"_127":-5,"_128":-5,"_129":-5,"_68":146,"_69":-5},{"_15":135,"_29":136,"_31":137,"_32":138,"_33":-5,"_34":139,"_35":36,"_37":140,"_39":-5,"_40":141,"_42":142,"_44":143,"_121":144,"_51":-5,"_122":-5,"_123":-5,"_124":-5,"_60":-5,"_125":-5,"_126":-5,"_127":-5,"_128":-5,"_129":-5,"_68":137,"_69":139},{"_15":130,"_29":131,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":132,"_39":-5,"_40":41,"_42":133,"_44":134,"_121":-5,"_51":-5,"_122":-5,"_123":-5,"_124":-5,"_60":-5,"_125":-5,"_126":-5,"_127":-5,"_128":-5,"_129":-5,"_68":131,"_69":-5},{"_15":116,"_29":117,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":118,"_39":-5,"_40":41,"_42":119,"_44":120,"_121":-5,"_51":-5,"_122":-5,"_123":-5,"_124":-5,"_60":-5,"_125":-5,"_126":-5,"_127":-5,"_128":-5,"_129":-5,"_68":117,"_69":-5},"person_A5111512545","Ramamohan Paturi","{\"openalex\":\"A5111512545\"}","2026-05-14T07:58:31.345604866","2026-05-23T12:16:11.263963716","orcid","affiliation","researchArea","paperCount","homepage","linkedin","twitter","github","hindex","person_A5109848440","Pavel Pudlák","{\"openalex\":\"A5109848440\"}","2026-05-15T01:09:07.340654582","2026-05-23T12:16:11.293921094","person_A5030610930","Michael Saks","麥可·薩克斯",[137],"美國數學家","{\"openalex\":\"A5030610930\",\"orcid\":\"0000-0003-1659-7190\"}","openalex,wikidata","2026-05-20T03:10:00.667590575","2026-05-23T12:16:11.339935009","0000-0003-1659-7190","person_A5073436821","Francis Zane","{\"openalex\":\"A5073436821\"}","2026-05-14T07:58:31.427271806","2026-05-23T12:16:12.190025313",{"_15":151,"_29":71,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":152,"_39":-5,"_40":153,"_42":154,"_44":155,"_156":157,"_158":159,"_160":-5,"_161":162,"_163":-5,"_124":-5,"_164":-5,"_68":71,"_69":-5},"tech_oa_T11596","{\"taxonomy_id\":\"tax_rd_T11596\"}","openalex_topics","2026-05-17T09:00:38.271512277","2026-05-17T09:00:38.271513421","techType","algorithm","domain","Physical Sciences","proposedYear","maturityLevel","growing","wikipediaUrl","patentCount",{"_15":192,"_29":70,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":193,"_39":-5,"_40":41,"_42":194,"_44":195,"_172":173,"_174":-5,"_175":176,"_177":190,"_179":196,"_181":26,"_182":183,"_184":26,"_185":-5,"_68":70,"_69":-5},{"_15":186,"_29":72,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":187,"_39":-5,"_40":41,"_42":188,"_44":189,"_172":173,"_174":-5,"_175":176,"_177":190,"_179":191,"_181":26,"_182":183,"_184":26,"_185":-5,"_68":72,"_69":-5},{"_15":168,"_29":71,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":169,"_39":-5,"_40":41,"_42":170,"_44":171,"_172":173,"_174":-5,"_175":176,"_177":178,"_179":180,"_181":26,"_182":183,"_184":26,"_185":-5,"_68":71,"_69":-5},"tax_rd_T11596","{\"openalex_topic\":\"T11596\"}","2026-05-14T01:23:37.250092314","2026-05-23T12:16:12.228884487","taxonomyType","RESEARCH_DOMAIN","code","level",3,"parentId","tax_rd_1705","path","Physical Sciences/Computer Science/Computer Networks and Communications/Constraint Satisfaction and Optimization","sortOrder","isLeaf",true,"entityCount","children","tax_rd_T10374","{\"openalex_topic\":\"T10374\"}","2026-05-14T00:42:06.292994479","2026-05-23T12:24:03.275859385","tax_rd_1703","Physical Sciences/Computer Science/Computational Theory and Mathematics/Advanced Graph Theory Research","tax_rd_T11567","{\"openalex_topic\":\"T11567\"}","2026-05-14T00:42:06.251901091","2026-05-23T12:16:12.207879084","Physical Sciences/Computer Science/Computational Theory and Mathematics/semigroups and automata theory",{"_73":198,"_75":199},[],[200],{"_78":201,"_80":202,"_82":203,"_84":204},1781054972823,{"_87":206,"_89":90,"_91":201,"_92":-5,"_93":26,"_94":26,"_95":26,"_96":-5,"_97":-5,"_98":67,"_35":99,"_100":101},[86,205],"[\"portal\",\"industries\"]","industries",[207,208,209,210,211,212,213,214,215,216,217,218],{"_15":270,"_29":271,"_31":-5,"_32":272,"_33":273,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":222,"_42":-5,"_44":-5,"_172":223,"_174":-5,"_175":90,"_177":224,"_179":274,"_181":26,"_182":67,"_184":26,"_185":-5,"_68":271,"_69":273},{"_15":266,"_29":267,"_31":-5,"_32":-5,"_33":268,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":222,"_42":-5,"_44":-5,"_172":223,"_174":-5,"_175":90,"_177":224,"_179":269,"_181":26,"_182":67,"_184":26,"_185":-5,"_68":267,"_69":268},{"_15":260,"_29":261,"_31":-5,"_32":262,"_33":263,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":222,"_42":-5,"_44":-5,"_172":223,"_174":-5,"_175":90,"_177":224,"_179":264,"_181":26,"_182":67,"_184":26,"_185":-5,"_68":261,"_69":263},{"_15":256,"_29":257,"_31":-5,"_32":-5,"_33":258,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":222,"_42":-5,"_44":-5,"_172":223,"_174":-5,"_175":90,"_177":224,"_179":259,"_181":26,"_182":67,"_184":26,"_185":-5,"_68":257,"_69":258},{"_15":252,"_29":253,"_31":-5,"_32":-5,"_33":254,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":222,"_42":-5,"_44":-5,"_172":223,"_174":-5,"_175":90,"_177":224,"_179":255,"_181":26,"_182":67,"_184":26,"_185":-5,"_68":253,"_69":254},{"_15":246,"_29":247,"_31":-5,"_32":248,"_33":249,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":222,"_42":-5,"_44":-5,"_172":223,"_174":-5,"_175":90,"_177":224,"_179":250,"_181":26,"_182":67,"_184":26,"_185":-5,"_68":247,"_69":249},{"_15":242,"_29":243,"_31":-5,"_32":-5,"_33":244,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":222,"_42":-5,"_44":-5,"_172":223,"_174":-5,"_175":90,"_177":224,"_179":245,"_181":26,"_182":183,"_184":26,"_185":-5,"_68":243,"_69":244},{"_15":238,"_29":239,"_31":-5,"_32":-5,"_33":240,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":222,"_42":-5,"_44":-5,"_172":223,"_174":-5,"_175":90,"_177":224,"_179":241,"_181":26,"_182":67,"_184":26,"_185":-5,"_68":239,"_69":240},{"_15":234,"_29":235,"_31":-5,"_32":-5,"_33":236,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":222,"_42":-5,"_44":-5,"_172":223,"_174":-5,"_175":90,"_177":224,"_179":237,"_181":26,"_182":67,"_184":26,"_185":-5,"_68":235,"_69":236},{"_15":230,"_29":231,"_31":-5,"_32":-5,"_33":232,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":222,"_42":-5,"_44":-5,"_172":223,"_174":-5,"_175":90,"_177":224,"_179":233,"_181":26,"_182":67,"_184":26,"_185":-5,"_68":231,"_69":232},{"_15":226,"_29":227,"_31":-5,"_32":-5,"_33":228,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":222,"_42":-5,"_44":-5,"_172":223,"_174":-5,"_175":90,"_177":224,"_179":229,"_181":26,"_182":67,"_184":26,"_185":-5,"_68":227,"_69":228},{"_15":219,"_29":220,"_31":-5,"_32":-5,"_33":221,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":222,"_42":-5,"_44":-5,"_172":223,"_174":-5,"_175":90,"_177":224,"_179":225,"_181":26,"_182":67,"_184":26,"_185":-5,"_68":220,"_69":221},"tax_ind_smartphone","智能手机","Smartphone","manual","INDUSTRY","tax_ind_root","科技行业/智能手机","tax_ind_robot","机器人","Robotics","科技行业/机器人","tax_ind_wearable","智能穿戴","Smart Wearables","科技行业/智能穿戴","tax_ind_energy","新能源与智能制造","New Energy & Smart Manufacturing","科技行业/新能源与智能制造","tax_ind_biotech","生物科技","Biotech","科技行业/生物科技","tax_ind_quantum","量子计算","Quantum Computing","科技行业/量子计算","tax_ind_blockchain","区块链",[251],"Blockchain","科技行业/区块链","Web3","tax_ind_enterprise","企业软件","Enterprise Software","科技行业/企业软件","tax_ind_security","网络安全","Cybersecurity","科技行业/网络安全","tax_ind_semi","半导体",[265],"Semiconductor","科技行业/半导体","芯片","tax_ind_cloud","云计算","Cloud Computing","科技行业/云计算","tax_ind_ai","人工智能",[275,276],"Artificial Intelligence","科技行业/人工智能","AI","AI 技术","env",{"_279":24},"SITE_BASE_URL"]

An improved exponential-time algorithm for <i>k</i> -SAT 论文

An improved exponential-time algorithm for <i>k</i> -SAT · 相关文章