{"id":"https://openalex.org/W7147567106","doi":"https://doi.org/10.1145/3802807.3802812","title":"SIGACT News Complexity Theory Column 127 and 128","display_name":"SIGACT News Complexity Theory Column 127 and 128","publication_year":2026,"publication_date":"2026-03-31","ids":{"openalex":"https://openalex.org/W7147567106","doi":"https://doi.org/10.1145/3802807.3802812"},"language":"en","primary_location":{"id":"doi:10.1145/3802807.3802812","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3802807.3802812","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","raw_type":"journal-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/A5073175433","display_name":"Ben Lee Volk","orcid":"https://orcid.org/0000-0002-7143-7280"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ben Lee Volk","raw_affiliation_strings":["Efi Arazi School of Computer Science, Reichman University, Herzliya, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Efi Arazi School of Computer Science, Reichman University, Herzliya, Israel","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5073175433"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.36508278,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"57","issue":"1","first_page":"41","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.3192000091075897,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.3192000091075897,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.14350000023841858,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.10509999841451645,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.8435999751091003},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4097000062465668},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4034999907016754},{"id":"https://openalex.org/keywords/row-and-column-spaces","display_name":"Row and column spaces","score":0.3720000088214874},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.3621000051498413},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.3077999949455261}],"concepts":[{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.8435999751091003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.722000002861023},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5008000135421753},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4097000062465668},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4034999907016754},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3970000147819519},{"id":"https://openalex.org/C104140500","wikidata":"https://www.wikidata.org/wiki/Q2088159","display_name":"Row and column spaces","level":3,"score":0.3720000088214874},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.3621000051498413},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.3077999949455261},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.2858999967575073},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28220000863075256},{"id":"https://openalex.org/C2992002026","wikidata":"https://www.wikidata.org/wiki/Q1111474","display_name":"General theory","level":2,"score":0.28040000796318054},{"id":"https://openalex.org/C112497148","wikidata":"https://www.wikidata.org/wiki/Q336787","display_name":"Enumerative combinatorics","level":2,"score":0.2754000127315521},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C179254644","wikidata":"https://www.wikidata.org/wiki/Q13222844","display_name":"Moment (physics)","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.26759999990463257}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3802807.3802812","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3802807.3802812","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Dear":[0],"Readers,":[1],"After":[2],"a":[3,13,21,33],"short":[4],"hiatus,":[5],"the":[6,45,71,82],"complexity":[7,48,117],"theory":[8],"column":[9,22,34],"is":[10],"back":[11],"with":[12],"double":[14],"feature!":[15],"In":[16],"this":[17],"issue,":[18],"we":[19,90],"present":[20],"by":[23,35,95],"Mitali":[24],"Bafna":[25],"on":[26,44],"Size-Efficient":[27],"PCPs":[28],"from":[29],"High-Dimensional":[30],"Expanders,":[31],"and":[32,41,56,66,107,115,121,129],"Fernando":[36],"Granha":[37],"Jeronimo,":[38],"Itai":[39],"Leigh":[40],"Pei":[42],"Wu":[43],"landscape":[46],"of":[47,137],"classes":[49],"surrounding":[50],"QMA(2).":[51],"Both":[52],"columns":[53,94],"are":[54],"excellent,":[55],"I":[57],"am":[58],"sure":[59],"you":[60],"will":[61,91],"find":[62],"them":[63],"both":[64],"enjoyable":[65],"enlightening.":[67],"Many":[68],"thanks":[69],"to":[70,88],"authors":[72],"for":[73,134],"their":[74],"hard":[75],"work!":[76],"What's":[77],"coming":[78],"up":[79],"next":[80],"in":[81],"pipeline?":[83],"If":[84],"all":[85],"goes":[86],"according":[87],"plan,":[89],"feature":[92],"guest":[93],"Geoffroy":[96],"Couteau;":[97],"Jesse":[98],"Goodman":[99],"(on":[100,110,124],"seedless":[101],"extractors);":[102],"Davi":[103],"Castro-Silva,":[104],"Arkopal":[105],"Dutt,":[106],"Tom":[108],"Gur":[109],"connections":[111],"between":[112],"additive":[113],"combinatorics":[114],"quantum":[116],"theory);":[118],"Debarati":[119],"Das;":[120],"Jeroen":[122],"Zuiddam":[123],"matrix":[125],"multiplication,":[126],"moment":[127],"polytopes":[128],"asymptotic":[130],"spectra).":[131],"Stay":[132],"tuned":[133],"upcoming":[135],"issues":[136],"SIGACT":[138],"News!":[139]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-04-02T00:00:00"}