{"id":"https://openalex.org/W1993837454","doi":"https://doi.org/10.1016/s1571-0661(04)80663-7","title":"Exact Algorithms for MAX-SAT","display_name":"Exact Algorithms for MAX-SAT","publication_year":2003,"publication_date":"2003-05-01","ids":{"openalex":"https://openalex.org/W1993837454","doi":"https://doi.org/10.1016/s1571-0661(04)80663-7","mag":"1993837454"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)80663-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80663-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)80663-7","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039343417","display_name":"Hantao Zhang","orcid":"https://orcid.org/0000-0003-1203-7997"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hantao Zhang","raw_affiliation_strings":["Computer Science Department, The University of Iowa, Iowa City, IA 52242, USA","Computer Science Department, The University of Iowa, Iowa City, IA 52242, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, The University of Iowa, Iowa City, IA 52242, USA","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"Computer Science Department, The University of Iowa, Iowa City, IA 52242, USA#TAB#","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102020267","display_name":"Haiou Shen","orcid":"https://orcid.org/0000-0001-6772-0502"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Haiou Shen","raw_affiliation_strings":["Computer Science Department, The University of Iowa, Iowa City, IA 52242, USA","Computer Science Department, The University of Iowa, Iowa City, IA 52242, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, The University of Iowa, Iowa City, IA 52242, USA","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"Computer Science Department, The University of Iowa, Iowa City, IA 52242, USA#TAB#","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061148416","display_name":"Felip Many\u00e0","orcid":"https://orcid.org/0000-0002-8366-1458"},"institutions":[{"id":"https://openalex.org/I15766328","display_name":"Universitat de Lleida","ror":"https://ror.org/050c3cw24","country_code":"ES","type":"education","lineage":["https://openalex.org/I15766328"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Felip Many\u00e0","raw_affiliation_strings":["Department of Computer Science, Universitat de Lleida, Jaume II, 69, 25001-Lleida, Spain"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universitat de Lleida, Jaume II, 69, 25001-Lleida, Spain","institution_ids":["https://openalex.org/I15766328"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5039343417","https://openalex.org/A5061148416","https://openalex.org/A5102020267"],"corresponding_institution_ids":["https://openalex.org/I126307644","https://openalex.org/I15766328"],"apc_list":null,"apc_paid":null,"fwci":5.0915,"has_fulltext":true,"cited_by_count":40,"citation_normalized_percentile":{"value":0.95575835,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"86","issue":"1","first_page":"190","last_page":"203"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.998199999332428,"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/T10142","display_name":"Formal Methods in Verification","score":0.998199999332428,"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/T11567","display_name":"semigroups and automata theory","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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.7233182191848755},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6560695171356201},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6423617005348206},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6306544542312622},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.5995190143585205},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5754172205924988},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5495501756668091},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5369752049446106},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49564826488494873},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48629340529441833},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47938254475593567},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.3700084090232849}],"concepts":[{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.7233182191848755},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6560695171356201},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6423617005348206},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6306544542312622},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.5995190143585205},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5754172205924988},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5495501756668091},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5369752049446106},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49564826488494873},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48629340529441833},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47938254475593567},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.3700084090232849},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/s1571-0661(04)80663-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80663-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:recercat.cat:10459.1/57944","is_oa":true,"landing_page_url":"http://hdl.handle.net/10459.1/57944","pdf_url":"http://hdl.handle.net/10459.1/57944","source":{"id":"https://openalex.org/S4306402147","display_name":"RECERCAT (Consorci de Serveis Universitaris de Catalunya)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210090028","host_organization_name":"Consorci de Serveis Universitaris de Catalunya","host_organization_lineage":["https://openalex.org/I4210090028"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.14.3447","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.3447","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uiowa.edu/~hzhang/sato/max2sat.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.58.2024","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.2024","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uiowa.edu/~hshen/maxsat.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)80663-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80663-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W17690413","https://openalex.org/W19577439","https://openalex.org/W70153617","https://openalex.org/W1491051759","https://openalex.org/W1513769081","https://openalex.org/W1516863390","https://openalex.org/W1556434751","https://openalex.org/W1564428908","https://openalex.org/W1581661059","https://openalex.org/W1896404939","https://openalex.org/W1968650717","https://openalex.org/W1990313671","https://openalex.org/W2006933117","https://openalex.org/W2020133533","https://openalex.org/W2049991966","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2085301456","https://openalex.org/W2095821893","https://openalex.org/W2126446661","https://openalex.org/W2154474334","https://openalex.org/W2171680292","https://openalex.org/W2998050925","https://openalex.org/W4214923326","https://openalex.org/W4238998407","https://openalex.org/W6817603220"],"related_works":["https://openalex.org/W2408080066","https://openalex.org/W2394616262","https://openalex.org/W2406837904","https://openalex.org/W3152212242","https://openalex.org/W2332241156","https://openalex.org/W3136261533","https://openalex.org/W4240446120","https://openalex.org/W3173322326","https://openalex.org/W2144163060","https://openalex.org/W2014111643"],"abstract_inverted_index":{"The":[0,144],"maximum":[1,22,106],"satisfiability":[2],"problem":[3],"(MAX-SAT)":[4],"is":[5,29,63,96,104,120,141,153,157,173,179],"stated":[6],"as":[7],"follows:":[8],"Given":[9],"a":[10,16,47,73,90],"boolean":[11],"formula":[12,71,119],"in":[13,46,56,69,100,113,121],"CNF,":[14],"find":[15],"truth":[17],"assignment":[18],"that":[19,89,123,191],"satisfies":[20],"the":[21,38,64,70,80,105,114,117,136,148,158,183],"possible":[23],"number":[24,65,107,159],"of":[25,37,66,79,108,110,139,147,160],"its":[26],"clauses.":[27,161],"MAX-SAT":[28,53,132],"MAX-SNP-complete":[30],"and":[31,44,72,135],"received":[32],"much":[33],"attention":[34],"recently.":[35],"One":[36],"challenges":[39],"posed":[40],"by":[41,87,98,175],"Alber,":[42],"Gramm":[43],"Niedermeier":[45],"recent":[48],"survey":[49],"paper":[50],"asks:":[51],"Can":[52],"be":[54],"solved":[55],"less":[57],"than":[58,182],"2n":[59],"\u201csteps\u201d?":[60],"Here,":[61],"n":[62,103],"distinct":[67],"variables":[68],"step":[74],"may":[75],"take":[76],"polynomial":[77],"time":[78,171],"input.":[81,115],"We":[82,162],"answered":[83],"this":[84],"challenge":[85],"positively":[86],"showing":[88],"popular":[91],"algorithm":[92,167,193,196],"based":[93],"on":[94,199],"branch-and-bound":[95],"bounded":[97],"O(2n)":[99],"time,":[101],"where":[102,155],"occurrences":[109],"any":[111,195],"variable":[112],"When":[116],"input":[118],"2-CNF,":[122],"is,":[124],"each":[125],"clause":[126],"has":[127],"at":[128],"most":[129],"two":[130],"literals,":[131],"becomes":[133],"MAX-2-SAT":[134,140,152,169],"decision":[137,166],"version":[138],"still":[142],"NP-complete.":[143],"best":[145],"bound":[146,174],"known":[149,185],"algorithms":[150],"for":[151,168],"O(m2m/5),":[154],"m":[156],"propose":[163],"an":[164],"efficient":[165],"whose":[170],"complexity":[172],"O(n2n).":[176],"This":[177],"result":[178],"substantially":[180],"better":[181],"previously":[184],"results.":[186],"Experimental":[187],"results":[188],"also":[189],"show":[190],"our":[192],"outperforms":[194],"we":[197],"know":[198],"MAX-2-SAT.":[200]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}