{"id":"https://openalex.org/W7110001916","doi":"https://doi.org/10.4230/lipics.icalp.2025.38","title":"Optimal Inapproximability of Promise Equations over Finite Groups","display_name":"Optimal Inapproximability of Promise Equations over Finite Groups","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7110001916","doi":"https://doi.org/10.4230/lipics.icalp.2025.38"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23415","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.38","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.38/LIPIcs.ICALP.2025.38.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":"publishedVersion"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.38/LIPIcs.ICALP.2025.38.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Butti, Silvia; id_orcid 0000-0002-0171-2021","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Butti, Silvia; id_orcid 0000-0002-0171-2021","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Larrauri, Alberto","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Larrauri, Alberto","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"\u017divn\u00fd, Stanislav","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\u017divn\u00fd, Stanislav","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"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.62736005,"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.43380001187324524,"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.43380001187324524,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.19009999930858612,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.09120000153779984,"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/constant","display_name":"Constant (computer programming)","score":0.5877000093460083},{"id":"https://openalex.org/keywords/abelian-group","display_name":"Abelian group","score":0.5490000247955322},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.3797000050544739},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.37139999866485596},{"id":"https://openalex.org/keywords/random-assignment","display_name":"Random assignment","score":0.3538999855518341},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.325300008058548}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6980999708175659},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5877000093460083},{"id":"https://openalex.org/C136170076","wikidata":"https://www.wikidata.org/wiki/Q181296","display_name":"Abelian group","level":2,"score":0.5490000247955322},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4293999969959259},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.3797000050544739},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3767000138759613},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.37139999866485596},{"id":"https://openalex.org/C129410224","wikidata":"https://www.wikidata.org/wiki/Q7291958","display_name":"Random assignment","level":2,"score":0.3538999855518341},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.325300008058548},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3221000134944916},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.25600001215934753},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23415","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.38","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.38/LIPIcs.ICALP.2025.38.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":"publishedVersion"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/42abac7b-1bda-4101-b040-738eb01e4eac","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/42abac7b-1bda-4101-b040-738eb01e4eac","pdf_url":"https://kclpure.kcl.ac.uk/ws/files/356018868/Optimal_Inapproximability_of_Promise_Equations_over_Finite_Groups_Version_of_Record.pdf","source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"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":"Butti, S, Larrauri, A & \u017divn\u00fd, S 2025, Optimal Inapproximability of Promise Equations over Finite Groups. in K Censor-Hillel, F Grandoni, J Ouaknine & G Puppis (eds), 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025., 38, Leibniz International Proceedings in Informatics, LIPIcs, vol. 334. https://doi.org/10.4230/LIPIcs.ICALP.2025.38","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23415","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.38","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.38/LIPIcs.ICALP.2025.38.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":"publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8702647912","display_name":null,"funder_award_id":"EP/X024431/1","funder_id":"https://openalex.org/F4320314731","funder_display_name":"UK Research and Innovation"}],"funders":[{"id":"https://openalex.org/F4320314731","display_name":"UK Research and Innovation","ror":"https://ror.org/001aqnf71"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7110001916.pdf","grobid_xml":"https://content.openalex.org/works/W7110001916.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"celebrated":[1],"result":[2,58],"of":[3,23,26,47,75],"H\u00e5stad":[4],"established":[5],"that,":[6],"for":[7,59,72],"any":[8,63],"constant":[9],"\u03b5":[10],">":[11],"0,":[12],"it":[13],"is":[14,39,92,104],"NP-hard":[15],"to":[16],"find":[17],"an":[18,32,42,81,108],"assignment":[19,43,79,90],"satisfying":[20,44],"a":[21,27,45,97],"(1/|G|+\u03b5)-fraction":[22],"the":[24,48,56,77,88,101],"constraints":[25,49],"given":[28],"3-LIN":[29,60,76,102],"instance":[30,103],"over":[31,62,107],"Abelian":[33],"group":[34],"G":[35],"even":[36],"if":[37],"one":[38],"promised":[40],"that":[41,87,100],"(1-\u03b5)-fraction":[46],"exists.":[50],"Engebretsen,":[51],"Holmerin,":[52],"and":[53],"Russell":[54],"showed":[55],"same":[57],"instances":[61,74],"finite":[64],"(not":[65],"necessarily":[66],"Abelian)":[67],"group.":[68,112],"In":[69],"other":[70],"words,":[71],"almost-satisfiable":[73],"random":[78,89],"achieves":[80],"optimal":[82],"approximation":[83],"guarantee.":[84],"We":[85],"prove":[86],"algorithm":[91],"still":[93],"best":[94],"possible":[95],"under":[96],"stronger":[98],"promise":[99],"almost":[105],"satisfiable":[106],"arbitrarily":[109],"more":[110],"restrictive":[111]},"counts_by_year":[],"updated_date":"2026-05-25T08:39:21.599409","created_date":"2025-12-08T00:00:00"}