{"id":"https://openalex.org/W2117882305","doi":"https://doi.org/10.1109/sfcs.2003.1238210","title":"On the maximum satisfiability of random formulas","display_name":"On the maximum satisfiability of random formulas","publication_year":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W2117882305","doi":"https://doi.org/10.1109/sfcs.2003.1238210","mag":"2117882305"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2003.1238210","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238210","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5021300666","display_name":"Dimitris Achlioptas","orcid":"https://orcid.org/0000-0003-2349-822X"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Achlioptas","raw_affiliation_strings":["Microsoft Research Limited, Redmond, WA, USA","[Microsoft Research,Redmond,WA,USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Limited, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"[Microsoft Research,Redmond,WA,USA]","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052985577","display_name":"Assaf Naor","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Naor","raw_affiliation_strings":["Microsoft Research Limited, Redmond, WA, USA","[Microsoft Research,Redmond,WA,USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Limited, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"[Microsoft Research,Redmond,WA,USA]","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020836845","display_name":"Yuval Peres","orcid":"https://orcid.org/0000-0001-5456-6323"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Y. Peres","raw_affiliation_strings":["Departments of Statistics and Mathematics, University of California, Berkeley, USA","University of California at Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departments of Statistics and Mathematics, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California at Berkeley","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"362","last_page":"370"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9926000237464905,"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/T11106","display_name":"Data Management and Algorithms","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/satisfiability","display_name":"Satisfiability","score":0.8936131000518799},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.6787613034248352},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5720491409301758},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5274826884269714},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5025849342346191},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4939883351325989},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4699338376522064},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.43073514103889465},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.10734054446220398}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.8936131000518799},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.6787613034248352},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5720491409301758},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5274826884269714},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5025849342346191},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4939883351325989},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4699338376522064},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.43073514103889465},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.10734054446220398},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"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/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/sfcs.2003.1238210","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238210","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.239.7420","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.239.7420","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/math/0305151v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.84.5603","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.5603","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucsc.edu/~optas/papers/max.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W125178576","https://openalex.org/W169076032","https://openalex.org/W1667614912","https://openalex.org/W1963913579","https://openalex.org/W1983976275","https://openalex.org/W1991365442","https://openalex.org/W1995226557","https://openalex.org/W1999032440","https://openalex.org/W2004216344","https://openalex.org/W2010193278","https://openalex.org/W2036265926","https://openalex.org/W2040924621","https://openalex.org/W2044722214","https://openalex.org/W2068871408","https://openalex.org/W2072802070","https://openalex.org/W2078137578","https://openalex.org/W2095709533","https://openalex.org/W2097113315","https://openalex.org/W2108446739","https://openalex.org/W2117882305","https://openalex.org/W2126420408","https://openalex.org/W2167266655","https://openalex.org/W6605109351","https://openalex.org/W6637229586","https://openalex.org/W6641350426","https://openalex.org/W6723629830"],"related_works":["https://openalex.org/W2408080066","https://openalex.org/W2394616262","https://openalex.org/W2406837904","https://openalex.org/W3152212242","https://openalex.org/W2014111643","https://openalex.org/W2102364390","https://openalex.org/W2336941104","https://openalex.org/W1913543287","https://openalex.org/W2571882453","https://openalex.org/W4211028879"],"abstract_inverted_index":{"Maximum":[0],"satisfiability":[1],"is":[2,19],"a":[3,22,50,78],"canonical":[4,23],"NP-complete":[5],"problem":[6,24],"that":[7],"appears":[8],"empirically":[9],"hard":[10],"for":[11,25,62,71,83],"random":[12,51,79],"instances.":[13],"At":[14],"the":[15,40,72],"same":[16],"time,":[17],"it":[18,87],"rapidly":[20],"becoming":[21],"statistical":[26],"physics.":[27],"In":[28,54,81],"both":[29],"of":[30,43,74],"these":[31],"realms,":[32],"evaluating":[33],"new":[34],"ideas":[35],"relies":[36],"crucially":[37],"on":[38],"knowing":[39],"maximum":[41],"number":[42],"clauses":[44,76],"one":[45],"can":[46],"typically":[47],"satisfy":[48],"in":[49,77],"k-CNF":[52],"formula.":[53],"this":[55,63],"paper":[56],"we":[57],"give":[58],"asymptotically":[59],"tight":[60,69],"estimates":[61],"quantity.":[64],"Our":[65],"result":[66],"gives":[67],"very":[68],"bounds":[70],"fraction":[73],"satisfiable":[75],"k-CNF.":[80],"particular,":[82],"k":[84],">":[85],"2":[86],"improves":[88],"upon":[89],"all":[90],"previously":[91],"known":[92],"such":[93],"bound.":[94]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}