{"id":"https://openalex.org/W7109991138","doi":"https://doi.org/10.4230/lipics.icalp.2025.14","title":"Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments","display_name":"Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7109991138","doi":"https://doi.org/10.4230/lipics.icalp.2025.14"},"language":"en","primary_location":{"id":"pmh:oai:pure.atira.dk:openaire/a9aa81a0-63f0-49dd-b287-2680140a8dc9","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/a9aa81a0-63f0-49dd-b287-2680140a8dc9","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Austrin, P, Bercea, I O, Goswami, M, Limaye, N & Srinivasan, A 2025, 'Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments.', Paper presented at EATCS International Colloquium on Automata, Languages, and Programming, Aarhus, Denmark, 08/07/2025 - 11/07/2025 pp. 14:1-14:17. https://doi.org/10.4230/LIPICS.ICALP.2025.14","raw_type":"info:eu-repo/semantics/conferenceObject"},"type":"conference-paper","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.itu.dk/portal/da/publications/a9aa81a0-63f0-49dd-b287-2680140a8dc9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Austrin, Per","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Austrin, Per","raw_affiliation_strings":["KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Bercea, Ioana O.","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Bercea, Ioana O.","raw_affiliation_strings":["KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Goswami, Mayank","orcid":null},"institutions":[{"id":"https://openalex.org/I111455621","display_name":"Queens College, CUNY","ror":"https://ror.org/03v8adn41","country_code":"US","type":"education","lineage":["https://openalex.org/I111455621"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Goswami, Mayank","raw_affiliation_strings":["Queens College, City University of New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Queens College, City University of New York, NY, USA","institution_ids":["https://openalex.org/I111455621"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Limaye, Nutan","orcid":null},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Limaye, Nutan","raw_affiliation_strings":["IT University of Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"last","author":{"id":null,"display_name":"Srinivasan, Adarsh","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Srinivasan, Adarsh","raw_affiliation_strings":["Rutgers University, Piscataway, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.56850716,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.44040000438690186,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.44040000438690186,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.290800005197525,"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.20069999992847443,"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/heuristics","display_name":"Heuristics","score":0.5691999793052673},{"id":"https://openalex.org/keywords/current","display_name":"Current (fluid)","score":0.5468999743461609},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5386999845504761},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5031999945640564},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42989999055862427},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.4147999882698059},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.3986999988555908},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.39419999718666077}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7143999934196472},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.600600004196167},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5691999793052673},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.5468999743461609},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5386999845504761},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5031999945640564},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42989999055862427},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.4147999882698059},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3986999988555908},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.39419999718666077},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.376800000667572},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.37450000643730164},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35409998893737793},{"id":"https://openalex.org/C520416788","wikidata":"https://www.wikidata.org/wiki/Q5419229","display_name":"Exact solutions in general relativity","level":2,"score":0.3264000117778778},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3163999915122986},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27950000762939453},{"id":"https://openalex.org/C177562468","wikidata":"https://www.wikidata.org/wiki/Q182893","display_name":"Dispersion (optics)","level":2,"score":0.27810001373291016},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2703000009059906},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25699999928474426},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:pure.atira.dk:openaire/a9aa81a0-63f0-49dd-b287-2680140a8dc9","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/a9aa81a0-63f0-49dd-b287-2680140a8dc9","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Austrin, P, Bercea, I O, Goswami, M, Limaye, N & Srinivasan, A 2025, 'Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments.', Paper presented at EATCS International Colloquium on Automata, Languages, and Programming, Aarhus, Denmark, 08/07/2025 - 11/07/2025 pp. 14:1-14:17. https://doi.org/10.4230/LIPICS.ICALP.2025.14","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:drops-oai.dagstuhl.de:23391","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.14","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.14/LIPIcs.ICALP.2025.14.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/a9aa81a0-63f0-49dd-b287-2680140a8dc9","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/a9aa81a0-63f0-49dd-b287-2680140a8dc9","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Austrin, P, Bercea, I O, Goswami, M, Limaye, N & Srinivasan, A 2025, 'Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments.', Paper presented at EATCS International Colloquium on Automata, Languages, and Programming, Aarhus, Denmark, 08/07/2025 - 11/07/2025 pp. 14:1-14:17. https://doi.org/10.4230/LIPICS.ICALP.2025.14","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2230064840","display_name":"AF:SMALL:RUI:UNDERSTANDING THE GEOMETRY AND DIVERSITY OF SOLUTIONS - ALGORITHMS FOR GENERATING DIVERSE SOLUTIONS IN OPTIMIZATION","funder_award_id":"2503086","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4054494677","display_name":"AF: Small: Hardness of Approximation Meets Parameterized Complexity","funder_award_id":"2313372","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4422840520","display_name":null,"funder_award_id":"16582","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"},{"id":"https://openalex.org/G5586229205","display_name":"CAREER: Price of Clustering in Geometric Spaces: Inapproximability, Conditional Lower Bounds, and More","funder_award_id":"2443697","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320334966","display_name":"Bhabha Atomic Research Centre","ror":"https://ror.org/05w6wfp17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,37,93,259,335],"k-CNF":[2,38,104],"formula":[3,19,39,161],"and":[4,44,62,119,141,147,163,210,214,285,316],"an":[5,340],"integer":[6],"s":[7,15,27,107,360],"\u2265":[8],"2,":[9,29,109],"we":[10,75,199,237,247,276],"study":[11],"algorithms":[12,129,138,173,204],"that":[13,20,77,143,216,249,352],"obtain":[14],"solutions":[16,157,257,280,333,347],"to":[17,65,91,224,239,281,355],"the":[18,34,87,100,110,115,153,156,160,166,230,250,344],"are":[21,133],"as":[22,24,67,227,229,300],"dispersed":[23],"possible.":[25],"For":[26,106,320],"=":[28,54],"this":[30,78,264,357],"problem":[31,111],"of":[32,36,102,155,159,268,272,322,346],"computing":[33,99],"diameter":[35,101,226],"was":[40,112],"initiated":[41],"by":[42,85,353],"Creszenzi":[43],"Rossi,":[45],"who":[46],"showed":[47],"strong":[48],"hardness":[49],"results":[50],"even":[51],"for":[52,98,125,174,182,244,296,329],"k":[53,68],"2.":[55],"The":[56],"current":[57,171],"best":[58],"upper":[59],"bound":[60],"[Angelsmark":[61],"Thapper\u201904]":[63],"goes":[64],"4n":[66],"\u2192":[69],"\u221e.":[70],"As":[71,195],"our":[72,196],"first":[73],"result,":[74,198],"show":[76,215,248,351],"quadratic":[79],"blow":[80],"up":[81],"is":[82,152,165,187],"not":[83],"necessary":[84],"utilizing":[86],"Fast-Fourier":[88],"transform":[89],"(FFT)":[90],"give":[92,136,286],"O*(2n)":[94],"time":[95,180,218,290],"exact":[96,137,327],"algorithm":[97,243],"any":[103,254],"formula.":[105],">":[108,233],"raised":[113],"in":[114,145,179,217,258,289],"SAT":[116,172,203],"community":[117],"(Nadel\u201911)":[118],"several":[120,297],"heuristics":[121],"have":[122,334],"been":[123],"proposed":[124],"it,":[126],"but":[127],"no":[128],"with":[130,292,337],"theoretical":[131],"guarantees":[132],"known.":[134],"We":[135,262],"using":[139],"FFT":[140],"clique-finding":[142],"run":[144,178,193],"O*(2(s\u22121)n)":[146],"O*(s2|\u03a9F|\u03c9\u2308s/3\u2309)":[148],"respectively,":[149],"where":[150],"|\u03a9F|":[151],"size":[154],"space":[158],"F":[162],"\u03c9":[164],"matrix":[167],"multiplication":[168],"exponent.":[169],"However,":[170],"finding":[175,330],"one":[176],"solution":[177],"O*(2\u03b5kn)":[181],"\u03b5k":[183],"\u2248":[184],"1\u2212\u0398(1/k),":[185],"which":[186],"much":[188],"faster":[189],"than":[190],"all":[191,321,325],"above":[192],"times.":[194],"main":[197],"analyze":[200],"two":[201],"popular":[202],"-":[205],"PPZ":[206,251,269],"(Paturi,":[207],"Pudl\u00e1k,":[208],"Zane\u201997)":[209],"Sch\u00f6ning\u2019s":[211,241],"(\u201902)":[212],"algorithms,":[213],"poly(s)O*(2\u03b5kn),":[219],"they":[220],"can":[221,361],"be":[222,271,362],"used":[223],"approximate":[225],"well":[228],"dispersion":[231],"(s":[232],"2)":[234],"problem.":[235],"While":[236],"need":[238],"modify":[240],"original":[242],"technical":[245],"reasons,":[246],"algorithm,":[252],"without":[253],"modification,":[255],"samples":[256],"geometric":[260,265],"sense.":[261],"believe":[263],"sampling":[266],"property":[267],"may":[270],"independent":[273],"interest.":[274],"Finally,":[275],"focus":[277],"on":[278,314,343,359],"diverse":[279,332],"NP-complete":[282],"optimization":[283],"problems,":[284,324],"bi-approximations":[287],"running":[288],"poly(s)O*(2\u03b5n)":[291],"\u03b5":[293],"<":[294],"1":[295],"problems":[298],"such":[299],"Maximum":[301],"Independent":[302],"Set,":[303,309,312],"Minimum":[304,307],"Vertex":[305,311,318],"Cover,":[306],"Hitting":[308],"Feedback":[310],"Multicut":[313],"Trees":[315],"Interval":[317],"Deletion.":[319],"these":[323],"existing":[326],"methods":[328,350],"optimal":[331],"runtime":[336],"at":[338],"least":[339],"exponential":[341],"dependence":[342,358],"number":[345],"s.":[348],"Our":[349],"relaxing":[354],"bi-approximations,":[356],"made":[363],"polynomial.":[364]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-12-08T00:00:00"}