{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:50:16Z","timestamp":1770295816812,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/N008197\/1"],"award-info":[{"award-number":["EP\/N008197\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3452143.3465530","type":"proceedings-article","created":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T22:32:21Z","timestamp":1626215541000},"page":"35-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Cyclotomic Identity Testing and Applications"],"prefix":"10.1145","author":[{"given":"Nikhil","family":"Balaji","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Delhi, New Delhi, India"}]},{"given":"Sylvain","family":"Perifel","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Paris, CNRS, IRIF, Paris, France"}]},{"given":"Mahsa","family":"Shirmohammadi","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Paris, CNRS, IRIF, Paris, France"}]},{"given":"James","family":"Worrell","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/792538.792540"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/070697926"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00227-2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1993-1195432-5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"N. Balaji S. Perifel M. Shirmohammadi and J. Worrell. 2020. Cyclotomic Identity Testing and Applications. CoRR Vol. abs\/2007.13179 (2020).","DOI":"10.1145\/3452143.3465530"},{"key":"e_1_3_2_1_6_1","volume-title":"Om Ligningen \u00b6hi n (x)= 0. Nyt tidsskrift for matematik","author":"Bang AS","year":"1895","unstructured":"AS Bang. 1895. Om Ligningen \u00b6hi n (x)= 0. Nyt tidsskrift for matematik, Vol. 6 (1895), 6--12."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215070"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68530-8_13"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321944"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798341600"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.15"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-008-9158-2"},{"key":"e_1_3_2_1_13_1","volume-title":"Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields. In MFCS (LNCS","volume":"31","author":"Chistov A. L.","unstructured":"A. L. Chistov and D. Grigoriev. 1984. Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields. In MFCS (LNCS, Vol. 176). Springer, 17--31."},{"key":"e_1_3_2_1_14_1","volume-title":"A taxonomy of problems with fast parallel algorithms. Information and control","author":"Cook S.","year":"1985","unstructured":"S. Cook. 1985. A taxonomy of problems with fast parallel algorithms. Information and control, Vol. 64, 1--3 (1985), 2--22."},{"key":"e_1_3_2_1_15_1","unstructured":"H. Davenport and H.L. Montgomery. 2013. Multiplicative Number Theory. Springer New York. 80026329"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/44483.44496"},{"key":"e_1_3_2_1_17_1","volume-title":"FOCS'93","author":"Ge G.","year":"1993","unstructured":"G. Ge. 1993. Testing equalities of multiplicative representations in polynomial time. In FOCS'93. IEEE, 422--426."},{"key":"e_1_3_2_1_18_1","volume-title":"FOCS'94","author":"Hirshfeld Y.","unstructured":"Y. Hirshfeld, M. Jerrum, and F. Moller. 1994. A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes. In FOCS'94. IEEE Computer Society, 623--631."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"H. Iwaniec and E. Kowalski. 2004. Analytic number theory. Vol. 53. AMS.","DOI":"10.1090\/coll\/053"},{"key":"e_1_3_2_1_20_1","volume-title":"ICALP","volume":"544","author":"Je A.","year":"2012","unstructured":"A. Je.z. 2012. Faster Fully Compressed Pattern Matching by Recompression. In ICALP 2012, Part I (LNCS, Vol. 7391). Springer, 533--544."},{"key":"e_1_3_2_1_21_1","volume-title":"ISSAC'06","author":"Kaltofen E.","unstructured":"E. Kaltofen and P. Koiran. 2006. Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. In ISSAC'06. 162--168."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/868026"},{"key":"e_1_3_2_1_23_1","volume-title":"Parallel Identity Testing for Skew Circuits with Big Powers and Applications. In MFCS'15","author":"K\u00f6nig Daniel","year":"2015","unstructured":"Daniel K\u00f6nig and Markus Lohrey. 2015. Parallel Identity Testing for Skew Circuits with Big Powers and Applications. In MFCS'15. Springer, 445--458."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322232"},{"key":"e_1_3_2_1_25_1","volume-title":"Finding small degree factors of lacunary polynomials. Number theory in progress","author":"Lenstra H. W.","year":"1999","unstructured":"H. W. Lenstra Jr. 1999. Finding small degree factors of lacunary polynomials. Number theory in progress, Vol. 1 (1999), 267--276."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02522825"},{"key":"e_1_3_2_1_27_1","volume-title":"Some Useful Bounds","author":"Mignotte M.","unstructured":"M. Mignotte. 1983. Some Useful Bounds. Springer, 259--263."},{"key":"e_1_3_2_1_28_1","first-page":"7","article-title":"Zur Theorie der Kreisteilungs-gleichung. S.-B. der Math.-Naturwiss. Class der Kaiser. Akad. Der Wiss","volume":"87","author":"Migotti A","year":"1883","unstructured":"A Migotti. 1883. Zur Theorie der Kreisteilungs-gleichung. S.-B. der Math.-Naturwiss. Class der Kaiser. Akad. Der Wiss., Wien, Vol. 87 ( 1883), 7--14.","journal-title":"Wien"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0060851"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579205"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90130-0"},{"key":"e_1_3_2_1_33_1","volume-title":"Testing Equivalence of Morphisms on Context-Free Languages. In ESA'94 (LNCS","volume":"470","author":"Plandowski W.","year":"1994","unstructured":"W. Plandowski. 1994. Testing Equivalence of Morphisms on Context-Free Languages. In ESA'94 (LNCS, Vol. 855). Springer, 460--470."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221053"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/448\/08667"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_6"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09510-1_42"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212043"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.2307\/3619567"}],"event":{"name":"ISSAC '21: International Symposium on Symbolic and Algebraic Computation","location":"Virtual Event Russian Federation","acronym":"ISSAC '21","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452143.3465530","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452143.3465530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:08Z","timestamp":1750193288000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452143.3465530"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":38,"alternative-id":["10.1145\/3452143.3465530","10.1145\/3452143"],"URL":"https:\/\/doi.org\/10.1145\/3452143.3465530","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}