{"id":"https://openalex.org/W4234274921","doi":"https://doi.org/10.1109/lics.2017.8005082","title":"Definability of summation problems for Abelian groups and semigroups","display_name":"Definability of summation problems for Abelian groups and semigroups","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W4234274921","doi":"https://doi.org/10.1109/lics.2017.8005082"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2017.8005082","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005082","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"article","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/A5056037337","display_name":"Faried Abu Zaid","orcid":null},"institutions":[{"id":"https://openalex.org/I119449181","display_name":"Technische Universit\u00e4t Ilmenau","ror":"https://ror.org/01weqhp73","country_code":"DE","type":"education","lineage":["https://openalex.org/I119449181"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Faried Abu Zaid","raw_affiliation_strings":["TU Ilmenau"],"affiliations":[{"raw_affiliation_string":"TU Ilmenau","institution_ids":["https://openalex.org/I119449181"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080843415","display_name":"Anuj Dawar","orcid":"https://orcid.org/0000-0003-4014-8248"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Anuj Dawar","raw_affiliation_strings":["University of Cambridge"],"affiliations":[{"raw_affiliation_string":"University of Cambridge","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109317643","display_name":"Erich Gr\u00e4del","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Erich Gradel","raw_affiliation_strings":["RWTH Aachen University"],"affiliations":[{"raw_affiliation_string":"RWTH Aachen University","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028116098","display_name":"Wied Pakusa","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Wied Pakusa","raw_affiliation_strings":["University of Oxford"],"affiliations":[{"raw_affiliation_string":"University of Oxford","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5056037337"],"corresponding_institution_ids":["https://openalex.org/I119449181"],"apc_list":null,"apc_paid":null,"fwci":0.2271,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.61259894,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"11"},"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.9983999729156494,"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.9983999729156494,"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/T10142","display_name":"Formal Methods in Verification","score":0.996399998664856,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9959999918937683,"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/abelian-group","display_name":"Abelian group","score":0.6438724398612976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6206925511360168},{"id":"https://openalex.org/keywords/semigroup","display_name":"Semigroup","score":0.5462222099304199},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.489391028881073},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.468401163816452},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4652157127857208},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.45737767219543457},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4523197412490845},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.439535915851593},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.4316812753677368},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4294903576374054},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.4154142737388611},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3763976991176605},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.3039636015892029},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09208863973617554}],"concepts":[{"id":"https://openalex.org/C136170076","wikidata":"https://www.wikidata.org/wiki/Q181296","display_name":"Abelian group","level":2,"score":0.6438724398612976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6206925511360168},{"id":"https://openalex.org/C207405024","wikidata":"https://www.wikidata.org/wiki/Q207348","display_name":"Semigroup","level":2,"score":0.5462222099304199},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.489391028881073},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.468401163816452},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4652157127857208},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.45737767219543457},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4523197412490845},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.439535915851593},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.4316812753677368},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4294903576374054},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.4154142737388611},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3763976991176605},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.3039636015892029},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09208863973617554},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"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/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.2017.8005082","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005082","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W157368094","https://openalex.org/W1484653117","https://openalex.org/W1489366126","https://openalex.org/W1493132637","https://openalex.org/W1975880448","https://openalex.org/W1993886628","https://openalex.org/W2014767626","https://openalex.org/W2045027298","https://openalex.org/W2045916776","https://openalex.org/W2090337980","https://openalex.org/W2097212968","https://openalex.org/W2105223629","https://openalex.org/W2116445981","https://openalex.org/W2117313088","https://openalex.org/W2121755852","https://openalex.org/W2138556324","https://openalex.org/W2211319681","https://openalex.org/W2245089271","https://openalex.org/W2290968667","https://openalex.org/W2293299776","https://openalex.org/W2592241421","https://openalex.org/W2761587086","https://openalex.org/W2782001694","https://openalex.org/W3103648976","https://openalex.org/W4214702250","https://openalex.org/W4297192537","https://openalex.org/W6654055338","https://openalex.org/W6675929344","https://openalex.org/W6683384914","https://openalex.org/W6690997022"],"related_works":["https://openalex.org/W1258892498","https://openalex.org/W1522618089","https://openalex.org/W2905073546","https://openalex.org/W3080158623","https://openalex.org/W4360838296","https://openalex.org/W2187958446","https://openalex.org/W2389075355","https://openalex.org/W2494517118","https://openalex.org/W1856194915","https://openalex.org/W2221885959"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,18,44,59,78,97,111,136,148,157,166,213,230,246,271,274,277,297,330,349,357],"descriptive":[3],"complexity":[4],"of":[5,22,37,49,61,99,204,207,245,258,263,273,333,351],"summation":[6,19,168,278,358],"problems":[7],"in":[8,64,80,150,173,178,180,190,202,229,285,302,312,367],"Abelian":[9,24,281,362],"groups":[10,282],"and":[11,33,76,118,128,283,327,346],"semigroups.":[12],"In":[13,266,289,335],"general,":[14],"an":[15,23,115,121,191],"input":[16],"to":[17,42,134,146,159,240],"problem":[20,89,211,279,298],"consists":[21],"semigroup":[25,112],"G,":[26],"explicitly":[27],"represented":[28],"by":[29,139],"its":[30,102],"multiplication":[31],"table,":[32],"a":[34,54,81,125,131,162,252,323,342,378],"subset":[35],"X":[36,62,119],"G.":[38],"The":[39,199],"task":[40],"is":[41,53,94,104,143,212,243,310,320,375],"determine":[43],"sum":[45,79,149],"over":[46,161,361],"all":[47],"elements":[48,60,72,137],"X.":[50],"Algorithmically":[51],"this":[52,87,208,267,314],"very":[55],"simple":[56],"problem.":[57],"If":[58,108],"come":[63],"some":[65],"order,":[66],"then":[67,141],"we":[68,109,269,294,340],"can":[69,226,299],"process":[70,135],"these":[71],"along":[73],"that":[74,95,153,254,296,348],"order":[75,127],"calculate":[77],"trivial":[82,167],"way.":[83],"However,":[84],"what":[85],"makes":[86],"fundamental":[88],"so":[90],"interesting":[91],"for":[92,251,276,280],"us":[93],"from":[96],"viewpoint":[98],"logical":[100,205],"definability":[101,275],"tractability":[103],"much":[105],"more":[106,219],"delicate.":[107],"consider":[110],"G":[113],"as":[114,120],"abstract":[116,122,187],"structure":[117],"set,":[123],"without":[124,130,194,371],"linear":[126,163],"hence":[129],"canonical":[132],"way":[133,193],"one":[138,244],"one,":[140],"it":[142,225],"unclear":[144],"how":[145],"define":[147],"any":[151,174,181],"logic":[152,176,231,253,304,370],"does":[154],"not":[155],"have":[156],"power":[158],"quantify":[160],"order.":[164],"Indeed":[165],"algorithm":[169],"cannot":[170,354,364],"be":[171,227,256,300,355,365],"expressed":[172,228],"polynomial-time":[175,261,287],"or,":[177],"fact,":[179],"computational":[182],"model":[183],"which":[184],"works":[185],"on":[186,322,377],"mathematical":[188,210],"structures":[189],"isomorphism-invariant":[192],"violating":[195],"polynomial":[196],"resource":[197],"bounds.":[198],"surprising":[200],"difficulty,":[201],"terms":[203],"definability,":[206],"basic":[209],"reason":[214],"why":[215],"Ben":[216],"Rossman":[217],"asked,":[218],"than":[220],"ten":[221],"years":[222],"ago,":[223],"whether":[224],"Choiceless":[232],"Polynomial":[233],"Time":[234],"with":[235,305],"counting":[236,306,331,352],"(CPT).":[237],"Note":[238],"that,":[239],"date,":[241],"CPT":[242,313],"most":[247],"powerful":[248],"known":[249],"candidates":[250],"might":[255],"capable":[257],"defining":[259],"every":[260],"property":[262],"finite":[264],"structures.":[265],"paper":[268],"clarify":[270],"status":[272],"semigroups":[284],"important":[286],"logics.":[288],"our":[290,336],"first":[291],"main":[292,338],"result":[293,339],"show":[295,347],"defined":[301,366],"fixed-point":[303,369],"(FPC).":[307],"Since":[308],"FPC":[309],"contained":[311],"settles":[315],"Rossman's":[316],"question.":[317],"Our":[318,373],"proof":[319,374],"based":[321,376],"dynamic":[324],"programming":[325],"approach":[326],"heavily":[328],"uses":[329],"mechanism":[332],"FPC.":[334],"second":[337],"give":[341],"matching":[343],"lower":[344],"bound":[345],"use":[350],"operators":[353],"avoided:":[356],"problem,":[359],"even":[360],"groups,":[363],"pure":[368],"counting.":[372],"probabilistic":[379],"argument.":[380]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}