{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:14:37Z","timestamp":1778498077217,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662557501","type":"print"},{"value":"9783662557518","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-55751-8_10","type":"book-chapter","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T15:32:49Z","timestamp":1502811169000},"page":"111-122","source":"Crossref","is-referenced-by-count":1,"title":["Testing Polynomial Equivalence by Scaling Matrices"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. V. Raghavendra","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayalal","family":"Sarma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,16]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/11672142_8","volume-title":"STACS 2006","author":"M Agrawal","year":"2006","unstructured":"Agrawal, M., Saxena, N.: Equivalence of \n            $$\\mathbb{F}$$\n          -algebras and cubic forms. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 115\u2013126. Springer, Heidelberg (2006). doi:\n10.1007\/11672142_8"},{"key":"10_CR2","series-title":"Progress in Computer Science and Applied Logic","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-05446-9_6","volume-title":"Perspectives in Computational Complexity","author":"M Bl\u00e4ser","year":"2014","unstructured":"Bl\u00e4ser, M.: Explicit tensors. In: Agrawal, M., Arvind, V. (eds.) Perspectives in Computational Complexity. PCSAL, vol. 26, pp. 117\u2013130. Springer, Cham (2014). doi:\n10.1007\/978-3-319-05446-9_6"},{"key":"10_CR3","series-title":"Grundlehren der mathematischen Wissenschaften","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic Complexity Theory","author":"P B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften, vol. 315. Springer, Heidelberg (1997)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Canny, J.F.: Some algebraic and geometric computations in PSPACE. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, 2\u20134 May 1988, pp. 460\u2013467 (1988)","DOI":"10.1145\/62212.62257"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-662-43948-7_35","volume-title":"Automata, Languages, and Programming","author":"Z Dvir","year":"2014","unstructured":"Dvir, Z., Oliveira, R.M., Shpilka, A.: Testing equivalence of polynomials under shifts. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 417\u2013428. Springer, Heidelberg (2014). doi:\n10.1007\/978-3-662-43948-7_35"},{"issue":"1","key":"10_CR6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0304-3975(96)00188-0","volume":"180","author":"D Grigoriev","year":"1997","unstructured":"Grigoriev, D.: Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. Theor. Comput. Sci. 180(1), 217\u2013228 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"1\/2","key":"10_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00037-004-0182-6","volume":"13","author":"V Kabanets","year":"2004","unstructured":"Kabanets, V., Impagliazzo, R.: Derandomizing polynomial identity tests means proving circuit lower bounds. Comput. Complex. 13(1\/2), 1\u201346 (2004)","journal-title":"Comput. Complex."},{"key":"10_CR8","doi-asserted-by":"crossref","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 2011, San Francisco, California, USA, 23\u201325 January 2011, pp. 1409\u20131421 (2011)","DOI":"10.1137\/1.9781611973082.108"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Kayal, N.: Affine projections of polynomials: extended abstract. In: Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, 19\u201322 May 2012, pp. 643\u2013662 (2012)","DOI":"10.1145\/2213977.2214036"},{"key":"10_CR10","unstructured":"Kayal, N., Nair, V., Saha, C., Tavenas, S.: Reconstruction of full rank algebraic branching programs. In: 32nd IEEE Conference on Computational Complexity (CCC) (2017, to appear)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Klivans, A.R., Spielman, D.A.: Randomness efficient identity testing of multivariate polynomials. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 6\u20138 July 2001, Heraklion, Crete, Greece, pp. 216\u2013223 (2001)","DOI":"10.1145\/380752.380801"},{"key":"10_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0041-0","volume-title":"Algebra","author":"S Lang","year":"2002","unstructured":"Lang, S.: Algebra. Springer, Heidelberg (2002)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"J Patarin","year":"1996","unstructured":"Patarin, J.: Hidden fields equations (HFE) and Isomorphisms of polynomials (IP): two new families of asymmetric algorithms. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33\u201348. Springer, Heidelberg (1996). doi:\n10.1007\/3-540-68339-9_4"},{"key":"10_CR14","unstructured":"Saxena, N.: Morphisms of rings and applications to complexity. Ph.D. thesis, Department of Computer Science, Indian Institute of Technology, Kanpur, India (2006)"},{"key":"10_CR15","unstructured":"Schaefer, M., Stefankovic, D.: The complexity of tensor rank. CoRR, abs\/1612.04338 (2016)"},{"key":"10_CR16","unstructured":"Shitov, Y.: How hard is tensor rank? CoRR, abs\/1611.01559 (2016)"},{"key":"10_CR17","unstructured":"Thierauf, T.: The isomorphism problem for read-once branching programs and arithmetic circuits. Chic. J. Theor. Comput. Sci. 1998(1) (1998)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55751-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T15:35:17Z","timestamp":1502811317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55751-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662557501","9783662557518"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55751-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}