{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T23:05:06Z","timestamp":1773183906081,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031304477","type":"print"},{"value":"9783031304484","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30448-4_22","type":"book-chapter","created":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T20:29:36Z","timestamp":1682368176000},"page":"308-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Complete Decomposition of\u00a0Symmetric Tensors in\u00a0Linear Time and\u00a0Polylogarithmic Precision"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Koiran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhayan","family":"Saha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,25]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","unstructured":"Banks, J., Garza-Vargas, J., Kulkarni, A., Srivastava, N.: Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time. In: IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00056","DOI":"10.1109\/FOCS46700.2020.00056"},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1137\/18M1200531","volume":"40","author":"C Beltr\u00e1n","year":"2019","unstructured":"Beltr\u00e1n, C., Breiding, P., Vannieuwenhoven, N.: Pencil-based algorithms for tensor rank decomposition are not stable. SIAM J. Matrix Anal. Appl. 40(2), 739\u2013773 (2019). https:\/\/doi.org\/10.1137\/18M1200531","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.jsc.2010.08.001","volume":"46","author":"A Bernardi","year":"2011","unstructured":"Bernardi, A., Gimigliano, A., Id\u00e0, M.: Computing symmetric rank for symmetric tensors. J. Symb. Comput. 46(1), 34\u201353 (2011). https:\/\/doi.org\/10.1016\/j.jsc.2010.08.001","journal-title":"J. Symb. Comput."},{"key":"22_CR4","doi-asserted-by":"publisher","unstructured":"Bhargava, V., Saraf, S., Volkovich, I.: Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 809\u2013822 (2021). https:\/\/doi.org\/10.1145\/3406325.3451096","DOI":"10.1145\/3406325.3451096"},{"key":"22_CR5","doi-asserted-by":"publisher","unstructured":"Bhaskara, A., Charikar, M., Moitra, A., Vijayaraghavan, A.: Smoothed analysis of tensor decompositions. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing (STOC), pp. 594\u2013603 (2014). https:\/\/doi.org\/10.1145\/2591796.2591881","DOI":"10.1145\/2591796.2591881"},{"key":"22_CR6","unstructured":"Brachat, J., Comon, P., Mourrain, B., Tsigaridas, E.P.: Symmetric tensor decomposition. In: 17th European Signal Processing Conference (EUSIPCO). IEEE (2009). https:\/\/ieeexplore.ieee.org\/document\/7077748\/"},{"key":"22_CR7","doi-asserted-by":"publisher","unstructured":"Forbes, M.A., Shpilka, A.: A PSPACE construction of a hitting set for the closure of small algebraic circuits. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 1180\u20131192 (2018). https:\/\/doi.org\/10.1145\/3188745.3188792","DOI":"10.1145\/3188745.3188792"},{"key":"22_CR8","doi-asserted-by":"publisher","unstructured":"Goyal, N., Vempala, S., Xiao, Y.: Fourier PCA and robust tensor decomposition. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing (STOC), pp. 584\u2013593 (2014). https:\/\/doi.org\/10.1145\/2591796.2591875","DOI":"10.1145\/2591796.2591875"},{"key":"22_CR9","unstructured":"Harshman, R.: Foundations of the PARAFAC procedure: models and conditions for an \"explanatory\" multi-mode factor analysis. UCLA Working Papers in Phonetics (1970). https:\/\/www.psychology.uwo.ca\/faculty\/harshman\/wpppfac0.pdf"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/BFb0035776","volume-title":"Automata, Languages and Programming","author":"J H\u00e5stad","year":"1989","unstructured":"H\u00e5stad, J.: Tensor rank is NP-complete. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 451\u2013460. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0035776"},{"key":"22_CR11","doi-asserted-by":"publisher","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms. Society for Industrial and Applied Mathematics, 2nd edn. (2002). https:\/\/doi.org\/10.1137\/1.9780898718027","DOI":"10.1137\/1.9780898718027"},{"key":"22_CR12","doi-asserted-by":"publisher","unstructured":"Kayal, N.: Efficient algorithms for some special cases of the polynomial equivalence problem. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1409\u20131421 (2011). https:\/\/doi.org\/10.1137\/1.9781611973082.108","DOI":"10.1137\/1.9781611973082.108"},{"key":"22_CR13","doi-asserted-by":"publisher","unstructured":"Koiran, P., Saha, S.: Complete decomposition of symmetric tensors in linear time and polylogarithmic precision (2022). https:\/\/doi.org\/10.48550\/ARXIV.2211.07407","DOI":"10.48550\/ARXIV.2211.07407"},{"issue":"3","key":"22_CR14","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009). https:\/\/doi.org\/10.1137\/07070111X","journal-title":"SIAM Rev."},{"issue":"2","key":"22_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0024-3795(77)90069-6","volume":"18","author":"JB Kruskal","year":"1977","unstructured":"Kruskal, J.B.: Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics. Linear Algebra Appl. 18(2), 95\u2013138 (1977). https:\/\/doi.org\/10.1016\/0024-3795(77)90069-6","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"22_CR16","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1137\/0614071","volume":"14","author":"SE Leurgans","year":"1993","unstructured":"Leurgans, S.E., Ross, R.T., Abel, R.B.: A decomposition for three-way arrays. SIAM J. Matrix Anal. Appl. 14(4), 1064\u20131083 (1993). https:\/\/doi.org\/10.1137\/0614071","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"22_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/9781316882177","volume-title":"Algorithmic Aspects of Machine Learning","author":"A Moitra","year":"2018","unstructured":"Moitra, A.: Algorithmic Aspects of Machine Learning. Cambridge University Press, Cambridge (2018) https:\/\/books.google.fr\/books?id=ruVqDwAAQBAJ"},{"key":"22_CR18","doi-asserted-by":"publisher","unstructured":"Peleg, S., Shpilka, A., Volk, B.L.: Tensor reconstruction beyond constant rank (2022). https:\/\/doi.org\/10.48550\/ARXIV.2209.04177","DOI":"10.48550\/ARXIV.2209.04177"},{"key":"22_CR19","doi-asserted-by":"publisher","unstructured":"Shitov, Y.: How hard is the tensor rank? (2016). https:\/\/doi.org\/10.48550\/ARXIV.1611.01559","DOI":"10.48550\/ARXIV.1611.01559"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1017\/S0962492900002774","volume":"6","author":"S Smale","year":"1997","unstructured":"Smale, S.: Complexity theory and numerical analysis. Acta Numer 6, 523\u2013551 (1997). https:\/\/doi.org\/10.1017\/S0962492900002774","journal-title":"Acta Numer"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30448-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T23:04:58Z","timestamp":1684191898000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30448-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304477","9783031304484"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30448-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Larnaca","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}