{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:55:06Z","timestamp":1781078106727,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100008398","name":"Villum Fonden","doi-asserted-by":"publisher","award":["16582"],"award-info":[{"award-number":["16582"]}],"id":[{"id":"10.13039\/100008398","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451124","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"1770-1783","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A full complexity dichotomy for immanant families"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7201-9905","authenticated-orcid":false,"given":"Radu","family":"Curticapean","sequence":"first","affiliation":[{"name":"IT University of Copenhagen, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01077707"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0513-7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22993-0_12"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33293-7_17"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-011-0018-0"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.IPEC.2019.3"},{"key":"e_1_3_2_1_7_1","volume-title":"Complexity and Completeness of Immanants. CoRR, cs.CC\/0301024","author":"Brylinski Jean-Luc","year":"2003","unstructured":"Jean-Luc Brylinski and Ranee Brylinski. 2003. Complexity and Completeness of Immanants. CoRR, cs.CC\/0301024, 2003. arxiv:cs\/0301024"},{"key":"e_1_3_2_1_8_1","volume-title":"Completeness and Reduction in Algebraic Complexity Theory. Algorithms and computation in mathematics. 7","author":"B\u00fcrgisser Peter","unstructured":"Peter B\u00fcrgisser. 2000. Completeness and Reduction in Algebraic Complexity Theory. Algorithms and computation in mathematics. 7, Springer. isbn:978-3-540-66752-0"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798367880"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798367892"},{"key":"e_1_3_2_1_11_1","volume-title":"Algebraic complexity theory. Grundlehren der mathematischen Wissenschaften. 315","author":"B\u00fcrgisser Peter","unstructured":"Peter B\u00fcrgisser, Michael Clausen, and Mohammad Amin Shokrollahi. 1997. Algebraic complexity theory. Grundlehren der mathematischen Wissenschaften. 315, Springer. isbn:3-540-60582-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374446"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci0300238"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1055"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39206-1_30"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47672-7_31"},{"key":"e_1_3_2_1_17_1","unstructured":"Radu Curticapean. 2015. The simple little and slow things count: on parameterized counting complexity. http:\/\/scidok.sulb.uni-saarland.de\/volltexte\/2015\/6217\/"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055502"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.22"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39053-1_10"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703427203"},{"key":"e_1_3_2_1_22_1","volume-title":"Representation Theory: A First Course","author":"Fulton W.","year":"1991","unstructured":"W. Fulton, W.F.J. Harris, and J. Harris. 1991. Representation Theory: A First Course. Springer New York. isbn:9780387974958 lccn:96165313"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/03081088508817680"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"D. E. Littlewood and A. R. Richardson. 1934. Group Characters and Algebra. Philosophical Transactions of the Royal Society of London. Series A Containing Papers of a Mathematical or Physical Character 233 1934. Pages 99\u2013141. issn:02643952 http:\/\/www.jstor.org\/stable\/91293","DOI":"10.1098\/rsta.1934.0015"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/193"},{"key":"e_1_3_2_1_26_1","volume-title":"Symmetric Functions and Hall Polynomials","author":"Macdonald I.G.","year":"1985","unstructured":"I.G. Macdonald. 1998. Symmetric Functions and Hall Polynomials. Clarendon Press. isbn:9780198504504 lccn:94027392 https:\/\/books.google.de\/books?id=srv90XiUbZoC"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2013.v009a006"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1155\/S1073792804142566"},{"key":"e_1_3_2_1_29_1","unstructured":"Istvan Miklos and Cordian Riener. 2021. \\#P-hardness proofs of matrix immanants evaluated on restricted matrices."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2005.07.017"},{"key":"e_1_3_2_1_31_1","volume-title":"Combinatorial Algorithms, and Symmetric Functions","author":"Sagan B.E.","unstructured":"B.E. Sagan. 2013. The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions. Springer New York. isbn:9781475768046 lccn:16418"},{"key":"e_1_3_2_1_32_1","unstructured":"I. Schur. 1901. \u00dcber eine Klasse von Matrizen die sich einer gegebenen Matrix zuordnen lassen."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01203611"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2015.10.034"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.110.113603"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1080\/14786436108243366"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804419"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451124","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:53Z","timestamp":1750195493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":38,"alternative-id":["10.1145\/3406325.3451124","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451124","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}