{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:48:15Z","timestamp":1725587295739},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220050"},{"type":"electronic","value":"9783642220067"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22006-7_61","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T03:44:05Z","timestamp":1308541445000},"page":"724-735","source":"Crossref","is-referenced-by-count":4,"title":["Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth"],"prefix":"10.1007","author":[{"given":"Maurice","family":"Jansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Santhanam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"61_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/11590156_6","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"M. Agrawal","year":"2005","unstructured":"Agrawal, M.: Proving lower bounds via pseudo-random generators. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 92\u2013105. Springer, Heidelberg (2005)"},{"key":"61_CR2","first-page":"781","volume":"2","author":"M. Agrawal","year":"2002","unstructured":"Agrawal, M., Kayal, N., Saxena, N.: Primes is in P. Ann. of Math\u00a02, 781\u2013793 (2002)","journal-title":"Ann. of Math"},{"key":"61_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, M., Vinay, V.: Arithmetic circuits: A chasm at depth four. In: Proc. 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 67\u201375 (2008)","DOI":"10.1109\/FOCS.2008.32"},{"key":"61_CR4","doi-asserted-by":"crossref","unstructured":"Allender, E.: The permanent requires large uniform threshold circuits. Chicago Journal of Theoretical Computer Science, article 7 (1999)","DOI":"10.4086\/cjtcs.1999.007"},{"key":"61_CR5","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"D.M. Barrington","year":"1990","unstructured":"Barrington, D.M., Immerman, N., Straubing, H.: On uniformity within NC1. J. Comp. Sys. Sci.\u00a041, 274\u2013306 (1990)","journal-title":"J. Comp. Sys. Sci."},{"key":"61_CR6","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0304-3975(83)90110-X","volume":"22","author":"W. Baur","year":"1982","unstructured":"Baur, W., Strassen, V.: The complexity of partial derivatives. Theor. Comp. Sci.\u00a022, 317\u2013330 (1982)","journal-title":"Theor. Comp. Sci."},{"key":"61_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00037-009-0260-x","volume":"18","author":"P. B\u00fcrgisser","year":"2009","unstructured":"B\u00fcrgisser, P.: On defining integers and proving arithmetic circuit lower bounds. Computational Complexity\u00a018, 81\u2013103 (2009)","journal-title":"Computational Complexity"},{"key":"61_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0020-0190(78)90067-4","volume":"7","author":"R. DeMillo","year":"1978","unstructured":"DeMillo, R., Lipton, R.: A probabilistic remark on algebraic program testing. Inf. Proc. Lett.\u00a07, 193\u2013195 (1978)","journal-title":"Inf. Proc. Lett."},{"key":"61_CR9","doi-asserted-by":"crossref","unstructured":"Grigoriev, D., Karpinski, M.: An exponential lower bound for depth 3 arithmetic circuits. In: Proc. 13th Annual ACM Symposium on the Theory of Computing, pp. 577\u2013582 (1998)","DOI":"10.1145\/276698.276872"},{"key":"61_CR10","doi-asserted-by":"crossref","unstructured":"Heintz, J., Schnorr, C.: Testing polynomials which are easy to compute (extended abstract). In: Proc. 12th Annual ACM Symposium on the Theory of Computing, pp. 262\u2013272 (1980)","DOI":"10.1145\/800141.804674"},{"issue":"4","key":"61_CR11","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1016\/S0022-0000(02)00025-9","volume":"64","author":"W. Hesse","year":"2001","unstructured":"Hesse, W., Allender, E., Barrington, D.: Uniform constant-depth threshold circuits for division and iterated multiplication. J. Comp. Sys. Sci.\u00a064(4), 695\u2013716 (2001)","journal-title":"J. Comp. Sys. Sci."},{"key":"61_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/322358.322373","volume":"30","author":"O. Ibarra","year":"1983","unstructured":"Ibarra, O., Moran, S.: Probabilistic algorithms for deciding equivalence of straight-line programs. J. Assn. Comp. Mach.\u00a030, 217\u2013228 (1983)","journal-title":"J. Assn. Comp. Mach."},{"key":"61_CR13","doi-asserted-by":"crossref","unstructured":"Jansen, M., Santhanam, R.: Marginal hitting sets imply super-polynomial lower bounds for permanent (2011) (manuscript)","DOI":"10.1145\/2090236.2090275"},{"issue":"1-2","key":"61_CR14","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 testing means proving circuit lower bounds. Computational Complexity\u00a013(1-2), 1\u201344 (2004)","journal-title":"Computational Complexity"},{"key":"61_CR15","unstructured":"Koiran, P.: Shallow circuits with high powered inputs. In: Proc. 2nd Symp. on Innovations in Computer Science (2010)"},{"key":"61_CR16","unstructured":"Koiran, P., Perifel, S.: Interpolation in Valiant\u2019s theory (2007) (to appear)"},{"key":"61_CR17","doi-asserted-by":"crossref","unstructured":"Koiran, P., Perifel, S.: A superpolynomial lower bound on the size of uniform non-constant-depth threshold circuits for the permanent. In: Proc. 24th Annual IEEE Conference on Computational Complexity (2009)","DOI":"10.1109\/CCC.2009.19"},{"key":"61_CR18","doi-asserted-by":"crossref","unstructured":"Raz, R.: Elusive functions and lower bounds for arithmetic circuits. Theory of Computing 6 (2010)","DOI":"10.1145\/1806689.1806780"},{"key":"61_CR19","doi-asserted-by":"crossref","unstructured":"Raz, R., Yehudayoff, A.: Lower bounds and separations for constant depth multilinear circuits. Computational Complexity 18(2) (2009)","DOI":"10.1007\/s00037-009-0270-8"},{"key":"61_CR20","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J. Schwartz","year":"1980","unstructured":"Schwartz, J.: Fast probabilistic algorithms for polynomial identities. J. Assn. Comp. Mach.\u00a027, 701\u2013717 (1980)","journal-title":"J. Assn. Comp. Mach."},{"issue":"1","key":"61_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00001609","volume":"10","author":"A. Shpilka","year":"2001","unstructured":"Shpilka, A., Wigderson, A.: Depth-3 arithmetic formulae over fields of characteristic zero. Journal of Computational Complexity\u00a010(1), 1\u201327 (2001)","journal-title":"Journal of Computational Complexity"},{"key":"61_CR22","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/0220053","volume":"20","author":"S. Toda","year":"1991","unstructured":"Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM J. Comput.\u00a020, 865\u2013877 (1991)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"61_CR23","first-page":"753","volume":"38","author":"J. Tor\u00e1n","year":"1991","unstructured":"Tor\u00e1n, J.: Complexity classes defined by counting quantifiers. J. Assn. Comp. Mach.\u00a038(3), 753\u2013774 (1991)","journal-title":"J. Assn. Comp. Mach."},{"key":"61_CR24","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L. Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of computing the permanent. Theor. Comp. Sci.\u00a08, 189\u2013201 (1979)","journal-title":"Theor. Comp. Sci."},{"key":"61_CR25","series-title":"A uniform approach","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity","author":"H. Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity. A uniform approach. Springer, Heidelberg (1999)"},{"key":"61_CR26","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF00289117","volume":"23","author":"K. Wagner","year":"1986","unstructured":"Wagner, K.: The complexity of combinatorial problems with succinct input representation. Acta Informatica\u00a023, 325\u2013356 (1986)","journal-title":"Acta Informatica"},{"key":"61_CR27","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1142\/S0129054191000066","volume":"2","author":"V. Zank\u00f3","year":"1991","unstructured":"Zank\u00f3, V.: #P-completeness via many-one reductions. International Journal of Foundations of Computer Science\u00a02, 77\u201382 (1991)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"61_CR28","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","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22006-7_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T21:48:06Z","timestamp":1560289686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22006-7_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220050","9783642220067"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22006-7_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}