{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:31:10Z","timestamp":1725798670450},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_2","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:33:02Z","timestamp":1407839582000},"page":"13-24","source":"Crossref","is-referenced-by-count":8,"title":["Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs"],"prefix":"10.1007","author":[{"given":"Eric","family":"Allender","sequence":"first","affiliation":[]},{"given":"Nikhil","family":"Balaji","sequence":"additional","affiliation":[]},{"given":"Samir","family":"Datta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1006\/jcss.1999.1675","volume":"60","author":"M. Agrawal","year":"2000","unstructured":"Agrawal, M., Allender, E., Datta, S.: On TC0, AC0, and Arithmetic circuits. Journal of Computer and System Sciences\u00a060(2), 395\u2013421 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR2","unstructured":"Allender, E., Schnorr, H.: The complexity of the BitSLP problem (2005) (unpublished manuscript)"},{"issue":"5","key":"2_CR3","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1137\/070697926","volume":"38","author":"E. Allender","year":"2009","unstructured":"Allender, E., B\u00fcrgisser, P., Kjeldgaard-Pedersen, J., Miltersen, P.B.: On the complexity of numerical analysis. SIAM J. Comput.\u00a038(5), 1987\u20132006 (2009)","journal-title":"SIAM J. Comput."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1137\/0215070","volume":"15","author":"P.W. Beame","year":"1986","unstructured":"Beame, P.W., Cook, S.A., Hoover, H.J.: Log depth circuits for division and related problems. SIAM Journal on Computing\u00a015, 994\u20131003 (1986)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1051\/ita:2001119","volume":"35","author":"A. Chiu","year":"2001","unstructured":"Chiu, A., Davida, G.I., Litow, B.: Division in logspace-uniform NC1. Informatique Th\u00e9orique et Applications\u00a035(3), 259\u2013275 (2001)","journal-title":"Informatique Th\u00e9orique et Applications"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-29952-0_22","volume-title":"Theory and Applications of Models of Computation","author":"S. Datta","year":"2012","unstructured":"Datta, S., Pratap, R.: Computing bits of algebraic numbers. In: Agrawal, M., Cooper, S.B., Li, A. (eds.) TAMC 2012. LNCS, vol.\u00a07287, pp. 189\u2013201. Springer, Heidelberg (2012)"},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(94)00021-2","volume":"50","author":"P. Dietz","year":"1994","unstructured":"Dietz, P., Macarie, I., Seiferas, J.: Bits and relative order from residues, space efficiently. Information Processing Letters\u00a050(3), 123\u2013127 (1994)","journal-title":"Information Processing Letters"},{"key":"2_CR8","unstructured":"Etessami, K.: Probability, recursion, games, and fixed points. talk presented at Horizons in TCS: A Celebration of Mihalis Yannakakis\u2019 60th Birthday (2013)"},{"issue":"6","key":"2_CR9","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.1137\/080720826","volume":"39","author":"K. Etessami","year":"2010","unstructured":"Etessami, K., Yannakakis, M.: On the complexity of Nash equilibria and other fixed points. SIAM J. Comput.\u00a039(6), 2531\u20132597 (2010)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/S0097539794274519","volume":"27","author":"M. Goldmann","year":"1998","unstructured":"Goldmann, M., Karpinski, M.: Simulating threshold circuits by majority circuits. SIAM J. Comput.\u00a027(1), 230\u2013246 (1998)","journal-title":"SIAM J. Comput."},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/11672142_55","volume-title":"STACS 2006","author":"A. Healy","year":"2006","unstructured":"Healy, A., Viola, E.: Constant-depth circuits for arithmetic in finite fields of characteristic two. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 672\u2013683. Springer, Heidelberg (2006)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/S0022-0000(02)00025-9","volume":"65","author":"W. Hesse","year":"2002","unstructured":"Hesse, W., Allender, E., Barrington, D.: Uniform constant-depth threshold circuits for division and iterated multiplication. Journal of Computer and System Sciences\u00a065, 695\u2013716 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.jnt.2009.08.009","volume":"130","author":"M. Hirvensalo","year":"2010","unstructured":"Hirvensalo, M., Karhum\u00e4ki, J., Rabinovich, A.: Computing partial information out of intractable: Powers of algebraic numbers as an example. Journal of Number Theory\u00a0130, 232\u2013253 (2010)","journal-title":"Journal of Number Theory"},{"key":"2_CR14","unstructured":"Hunter, P., Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: Computing rational radical sums in uniform TC0. In: FSTTCS, pp. 308\u2013316 (2010)"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2012.09.001","volume":"462","author":"E. Je\u0159\u00e1bek","year":"2012","unstructured":"Je\u0159\u00e1bek, E.: Root finding with threshold circuits. Theoretical Computer Science\u00a0462, 59\u201369 (2012)","journal-title":"Theoretical Computer Science"},{"key":"2_CR16","unstructured":"Jindal, G., Saranurak, T.: Subtraction makes computing integers faster. CoRR abs\/1212.2549 (2012)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Kayal, N., Saha, C.: On the sum of square roots of polynomials and related problems. TOCT 4(4), 9 (2012)","DOI":"10.1145\/2382559.2382560"},{"issue":"1-2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.tcs.2007.08.008","volume":"389","author":"P. Koiran","year":"2007","unstructured":"Koiran, P., Perifel, S.: The complexity of two problems on arithmetic circuits. Theor. Comput. Sci.\u00a0389(1-2), 172\u2013181 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"2_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-011-0002-8","volume":"20","author":"P. Koiran","year":"2011","unstructured":"Koiran, P., Perifel, S.: Interpolation in Valiant\u2019s theory. Computational Complexity\u00a020(1), 1\u201320 (2011)","journal-title":"Computational Complexity"},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1006\/inco.1998.2732","volume":"146","author":"A. Maciel","year":"1998","unstructured":"Maciel, A., Th\u00e9rien, D.: Threshold circuits of small majority-depth. Inf. Comput.\u00a0146(1), 55\u201383 (1998)","journal-title":"Inf. Comput."},{"issue":"1","key":"2_CR21","first-page":"39","volume":"34","author":"C. Mereghetti","year":"2000","unstructured":"Mereghetti, C., Palano, B.: Threshold circuits for iterated matrix product and powering. ITA\u00a034(1), 39\u201346 (2000)","journal-title":"ITA"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: Positivity problems for low-order linear recurrence sequences. In: SODA, pp. 366\u2013379 (2014)","DOI":"10.1137\/1.9781611973402.27"},{"issue":"2-3","key":"2_CR23","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.ipl.2006.11.003","volume":"102","author":"A.A. Sherstov","year":"2007","unstructured":"Sherstov, A.A.: Powering requires threshold depth 3. Inf. Process. Lett.\u00a0102(2-3), 104\u2013107 (2007)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"2_CR24","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1137\/S0895480192228619","volume":"7","author":"K.Y. Siu","year":"1994","unstructured":"Siu, K.Y., Roychowdhury, V.P.: On optimal depth threshold circuits for multiplication and related problems. SIAM J. Discrete Math.\u00a07(2), 284\u2013292 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"2_CR25","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."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Vollmer, H.: Introduction to Circuit Complexity. Springer (1999)","DOI":"10.1007\/978-3-662-03927-4"},{"issue":"2","key":"2_CR27","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0020-0190(93)90202-K","volume":"46","author":"I. Wegener","year":"1993","unstructured":"Wegener, I.: Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions. Inf. Process. Lett.\u00a046(2), 85\u201387 (1993)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T15:13:04Z","timestamp":1558969984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}