{"id":"https://openalex.org/W4413860065","doi":"https://doi.org/10.1145/3744915.3748473","title":"Exploring the Computational Complexity of Uniform Random Sampling and SAT Counting with Phase Transitions","display_name":"Exploring the Computational Complexity of Uniform Random Sampling and SAT Counting with Phase Transitions","publication_year":2025,"publication_date":"2025-08-30","ids":{"openalex":"https://openalex.org/W4413860065","doi":"https://doi.org/10.1145/3744915.3748473"},"language":"en","primary_location":{"id":"doi:10.1145/3744915.3748473","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3744915.3748473","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM International Systems and Software Product Line Conference - Volume A","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3744915.3748473","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080393412","display_name":"Olivier Zeyen","orcid":"https://orcid.org/0000-0003-0378-5643"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":true,"raw_author_name":"Olivier Zeyen","raw_affiliation_strings":["Interdisciplinary Centre for Security, Reliability and Trust, Univirsity of Luxembourg, Luxembourg, Luxembourg"],"affiliations":[{"raw_affiliation_string":"Interdisciplinary Centre for Security, Reliability and Trust, Univirsity of Luxembourg, Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000695937","display_name":"Maxime Cordy","orcid":"https://orcid.org/0000-0001-8312-1358"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"Maxime Cordy","raw_affiliation_strings":["Interdisciplinary Centre for Security, Reliability and Trust, University of Luxembourg, Luxembourg, Luxembourg"],"affiliations":[{"raw_affiliation_string":"Interdisciplinary Centre for Security, Reliability and Trust, University of Luxembourg, Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055104897","display_name":"Gilles Perrouin","orcid":"https://orcid.org/0000-0002-8431-0377"},"institutions":[{"id":"https://openalex.org/I149768937","display_name":"University of Namur","ror":"https://ror.org/03d1maw17","country_code":"BE","type":"education","lineage":["https://openalex.org/I149768937"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Gilles Perrouin","raw_affiliation_strings":["Faculty of Computer Science, PReCISE, University of Namur, Namur, Belgium"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, PReCISE, University of Namur, Namur, Belgium","institution_ids":["https://openalex.org/I149768937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003973216","display_name":"Mathieu Acher","orcid":"https://orcid.org/0000-0003-1483-3858"},"institutions":[{"id":"https://openalex.org/I56067802","display_name":"Universit\u00e9 de Rennes","ror":"https://ror.org/015m7wh34","country_code":"FR","type":"education","lineage":["https://openalex.org/I56067802"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I28221208","display_name":"Institut National des Sciences Appliqu\u00e9es de Rennes","ror":"https://ror.org/04xaa4j22","country_code":"FR","type":"education","lineage":["https://openalex.org/I28221208"]},{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mathieu Acher","raw_affiliation_strings":["INSA, Univ Rennes, Inria, CNRS, IRISA, Rennes, France"],"affiliations":[{"raw_affiliation_string":"INSA, Univ Rennes, Inria, CNRS, IRISA, Rennes, France","institution_ids":["https://openalex.org/I28221208","https://openalex.org/I2802519937","https://openalex.org/I56067802","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5080393412"],"corresponding_institution_ids":["https://openalex.org/I186903577"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34132488,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"149","last_page":"160"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9975000023841858,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9975000023841858,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.996399998664856,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9954000115394592,"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/computer-science","display_name":"Computer science","score":0.6706575751304626},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6383195519447327},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.49279096722602844},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.47310447692871094},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38668790459632874},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38174229860305786},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08833351731300354},{"id":"https://openalex.org/keywords/detector","display_name":"Detector","score":0.07075166702270508}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6706575751304626},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6383195519447327},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.49279096722602844},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.47310447692871094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38668790459632874},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38174229860305786},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08833351731300354},{"id":"https://openalex.org/C94915269","wikidata":"https://www.wikidata.org/wiki/Q1834857","display_name":"Detector","level":2,"score":0.07075166702270508}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3744915.3748473","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3744915.3748473","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM International Systems and Software Product Line Conference - Volume A","raw_type":"proceedings-article"},{"id":"pmh:oai:orbilu.uni.lu:10993/66114","is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/66114","pdf_url":null,"source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"SPLC 2025: 29th ACM International Systems and Software Product Line Conference - Proceedings (2025-08-31); Proceedings of the 29th ACM International Systems and Software Product Line Conference - Volume A, A Coruna, Esp [Esp], 01-09-2025 => 05-09-2025","raw_type":"peer reviewed"},{"id":"pmh:oai:pure.unamur.be:openaire/5b608ecd-2b86-438f-af1f-7a957e909321","is_oa":false,"landing_page_url":"https://researchportal.unamur.be/en/publications/5b608ecd-2b86-438f-af1f-7a957e909321","pdf_url":null,"source":{"id":"https://openalex.org/S4406922457","display_name":"Repository of the University of Namur","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Zeyen, O, Cordy, M, Perrouin, G & Acher, M 2025, Exploring the Computational Complexity of Uniform Random Sampling and SAT Counting with Phase Transitions. in M R Luaces, T V Rodeiro, S Greiner, J Galindo Duarte, T Yue, K Yoshimura, L Semini, M Cordy, M Azanza, J Kruger, G Perrouin, S Fortz, I Groher, D-J Munoz, K Schmid, F Perez, J Galasso-Carbonnel, J M Horcas & K Feichtinger (eds), SPLC 2025 : 29th ACM International Systems and Software Product Line Conference - Proceedings. SPLC 2025: 29th ACM International Systems and Software Product Line Conference - Proceedings, vol. A, ACM Press, New York, NY, USA, pp. 149\u2013160. https://doi.org/10.1145/3744915.3748473","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1145/3744915.3748473","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3744915.3748473","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM International Systems and Software Product Line Conference - Volume A","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1607857762","display_name":null,"funder_award_id":"","funder_id":"https://openalex.org/F4320321390","funder_display_name":"Fonds De La Recherche Scientifique - FNRS"}],"funders":[{"id":"https://openalex.org/F4320321390","display_name":"Fonds De La Recherche Scientifique - FNRS","ror":"https://ror.org/03q83t159"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W73352345","https://openalex.org/W255296881","https://openalex.org/W1515422723","https://openalex.org/W1537730723","https://openalex.org/W1565010992","https://openalex.org/W1592338211","https://openalex.org/W1608654004","https://openalex.org/W1650993530","https://openalex.org/W1710690747","https://openalex.org/W1985514943","https://openalex.org/W2040767332","https://openalex.org/W2041982261","https://openalex.org/W2072590803","https://openalex.org/W2093944715","https://openalex.org/W2095293504","https://openalex.org/W2109726592","https://openalex.org/W2120545184","https://openalex.org/W2121083000","https://openalex.org/W2149902097","https://openalex.org/W2525579820","https://openalex.org/W2615919345","https://openalex.org/W2740402962","https://openalex.org/W2793051425","https://openalex.org/W2794800068","https://openalex.org/W2810413193","https://openalex.org/W2941640074","https://openalex.org/W2967185606","https://openalex.org/W2984546510","https://openalex.org/W3005469596","https://openalex.org/W3043665946","https://openalex.org/W3090979236","https://openalex.org/W3150134748","https://openalex.org/W3183515694","https://openalex.org/W3204797423","https://openalex.org/W4220886077","https://openalex.org/W4232418529","https://openalex.org/W4256361765","https://openalex.org/W4315866202","https://openalex.org/W4393815502","https://openalex.org/W4399381916","https://openalex.org/W4401442125"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W4409439182","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2052122378","https://openalex.org/W2189341500","https://openalex.org/W2089783325"],"abstract_inverted_index":{"Uniform":[0],"Random":[1],"Sampling":[2],"(URS)":[3],"and":[4,28,44,109,155],"Model":[5],"Counting":[6],"(#SAT)":[7],"are":[8],"two":[9],"intrinsically":[10],"linked,":[11],"theoretical":[12],"problems":[13,49],"with":[14,140],"relevant":[15],"practical":[16,98],"applications":[17],"in":[18,23,118],"software":[19],"engineering.":[20],"In":[21],"particular,":[22],"configurable":[24],"system":[25],"engineering,":[26],"URS":[27,43,154],"#SAT":[29,45,156],"can":[30,95],"support":[31],"studying":[32],"configurations\u2019":[33],"properties":[34],"unbiasedly.":[35],"Despite":[36],"the":[37,61,87,97],"community":[38],"efforts":[39],"to":[40,60,83,149],"provide":[41],"scalable":[42],"tools,":[46],"solving":[47],"these":[48],"efficiently":[50],"remains":[51],"challenging":[52],"for":[53,128],"a":[54,80,123,141,150],"large":[55],"number":[56],"of":[57,71,100,153],"formulae.":[58],"Contrary":[59],"classical":[62],"SAT":[63,129],"problem,":[64],"whose":[65],"complexity":[66,99],"has":[67],"been":[68],"an":[69],"object":[70],"fundamental":[72],"studies,":[73],"little":[74],"is":[75,138],"known":[76],"about":[77],"what":[78],"makes":[79],"formula":[81,136],"hard":[82],"sample":[84],"from.":[85],"For":[86],"first":[88],"time,":[89],"we":[90],"investigate":[91],"how":[92],"phase":[93,115],"transitions":[94,116],"explain":[96],"sampling.":[101],"Our":[102],"results,":[103],"computed":[104],"on":[105],"11,409":[106],"synthetic":[107],"formulae":[108],"4656":[110],"real-world":[111],"formulae,":[112],"show":[113],"that":[114,134],"occur":[117],"both":[119],"cases,":[120],"but":[121],"at":[122],"different":[124],"clause-to-variable":[125],"ratio":[126],"than":[127],"tasks.":[130],"We":[131],"further":[132],"reveal":[133],"low":[135],"modularity":[137],"correlated":[139],"higher":[142],"URS/#SAT":[143],"time.":[144],"Overall,":[145],"our":[146],"work":[147],"contributes":[148],"principled":[151],"understanding":[152],"complexity.":[157]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}