乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:46Z","timestamp":1725796606560},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_1","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T10:04:30Z","timestamp":1404554670000},"page":"1-12","source":"Crossref","is-referenced-by-count":1,"title":["Building above Read-once Polynomials: Identity Testing and Hardness of Representation"],"prefix":"10.1007","author":[{"given":"Meena","family":"Mahajan","sequence":"first","affiliation":[]},{"given":"B. V. Raghavendra","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Karteek","family":"Sreenivasaiah","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N.: Combinatorial nullstellensatz. Combinatorics, Problem and Computing\u00a08 (1999)","DOI":"10.1017\/S0963548398003411"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, M., Vinay, V.: Arithmetic circuits: A chasm at depth four. In: FOCS, pp. 67\u201375 (2008)","DOI":"10.1109\/FOCS.2008.32"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Anderson, M., van Melkebeek, D., Volkovich, I.: Derandomizing polynomial identity testing for multilinear constant-read formulae. In: CCC, pp. 273\u2013282 (2011)","DOI":"10.1109\/CCC.2011.18"},{"key":"1_CR4","unstructured":"Bl\u00e4ser, M., Engels, C.: Randomness efficient testing of sparse black box identities of unbounded degree over the reals. In: STACS, pp. 555\u2013566 (2011)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-540-70575-8_29","volume-title":"Automata, Languages and Programming","author":"M. Bl\u00e4ser","year":"2008","unstructured":"Bl\u00e4ser, M., Hardt, M., Steurer, D.: Asymptotically optimal hitting sets against polynomials. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 345\u2013356. Springer, Heidelberg (2008)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Tiwari, P.: A deterministic algorithm for sparse multivariate polynominal interpolation (extended abstract). In: STOC, pp. 301\u2013309 (1988)","DOI":"10.1145\/62212.62241"},{"issue":"5","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1137\/05063605X","volume":"36","author":"Z. Dvir","year":"2007","unstructured":"Dvir, Z., Shpilka, A.: Locally decodable codes with two queries and polynomial identity testing for depth 3 circuits. SIAM J. Comput.\u00a036(5), 1404\u20131434 (2007)","journal-title":"SIAM J. Comput."},{"key":"1_CR8","unstructured":"Fournier, H., Malod, G., Mengel, S.: Monomials in arithmetic circuits: Complete problems in the counting hierarchy. In: STACS, pp. 362\u2013373 (2012)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kamath, P., Kayal, N., Saptharishi, R.: Arithmetic circuits: A chasm at depth three. In: FOCS, pp. 578\u2013587 (2013)","DOI":"10.1109\/FOCS.2013.68"},{"issue":"TR12-081","key":"1_CR10","first-page":"81","volume":"19","author":"N. Kayal","year":"2012","unstructured":"Kayal, N.: An exponential lower bound for the sum of powers of bounded degree polynomials. ECCC\u00a019(TR12-081), 81 (2012)","journal-title":"ECCC"},{"issue":"1-2","key":"1_CR11","doi-asserted-by":"publisher","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. Computational Complexity\u00a013(1-2), 1\u201346 (2004)","journal-title":"Computational Complexity"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Klivans, A., Spielman, D.A.: Randomness efficient identity testing of multivariate polynomials. In: STOC, pp. 216\u2013223 (2001)","DOI":"10.1145\/380752.380801"},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00037-007-0226-9","volume":"16","author":"N. Kayal","year":"2007","unstructured":"Kayal, N., Saxena, N.: Polynomial identity testing for depth 3 circuits. Computational Complexity\u00a016(2), 115\u2013138 (2007)","journal-title":"Computational Complexity"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Mahajan, M., Raghavendra Rao, B.V., Sreenivasaiah, K.: Monomials, multilinearity and identity testing in simple read-restricted circuits. Theoretical Computer Science\u00a0524, 90\u2013102 (2014), preliminary version in MFCS 2012","DOI":"10.1016\/j.tcs.2014.01.005"},{"key":"1_CR15","unstructured":"Raghavendra Rao, B.V., Sarma, J.M.N.: Isomorphism testing of read-once functions and polynomials. In: FSTTCS, pp. 115\u2013126 (2011)"},{"key":"1_CR16","unstructured":"Raghavendra Rao, B.V., Sarma, J.M.N.: Isomorphism testing of read-once functions and polynomials (2013) (Submitted Manuscript)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Saxena, N.: Progress on polynomial identity testing - ii. CoRR, abs\/1401.0976 (2014)","DOI":"10.1007\/978-3-319-05446-9_7"},{"issue":"4","key":"1_CR18","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J.T. Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM\u00a027(4), 701\u2013717 (1980)","journal-title":"J. ACM"},{"key":"1_CR19","unstructured":"Shpilka, A., Volkovich, I.: Read-once polynomial identity testing. STOC, pp. 507\u2013516 (2010), See also ECCC TR-2010-011"},{"key":"1_CR20","unstructured":"Shpilka, A., Volkovich, I.: Read-once polynomial identity testing. In: ECCC, p. 011 (2010), Preliminary version in STOC 2010"},{"issue":"3","key":"1_CR21","first-page":"207","volume":"5","author":"A. Shpilka","year":"2010","unstructured":"Shpilka, A., Yehudayoff, A.: Arithmetic circuits: A survey of recent results and open questions. Found. Trends Theor. Comput. Sci.\u00a05(3), 207\u2013388 (2010)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R. Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, K.W. (ed.) EUROSAM 1979 and ISSAC 1979. LNCS, vol.\u00a072, pp. 216\u2013226. Springer, Heidelberg (1979)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T03:13:24Z","timestamp":1558926804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}