{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T13:48:17Z","timestamp":1764251297369},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_22","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"189-201","source":"Crossref","is-referenced-by-count":3,"title":["Computing Bits of Algebraic Numbers"],"prefix":"10.1007","author":[{"given":"Samir","family":"Datta","sequence":"first","affiliation":[]},{"given":"Rameshwar","family":"Pratap","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","volume-title":"Handbook of Mathematical Functions: with Formulas, Graphs and Mathematical Tables","author":"M. Abramowitz","year":"1972","unstructured":"Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions: with Formulas, Graphs and Mathematical Tables. Dover, New York (1972)"},{"issue":"5","key":"22_CR2","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1137\/070697926","volume":"38","author":"E. Allender","year":"2009","unstructured":"Allender, E., B\u00fcrgisser, P., Pedersen, J.K., Miltersen, P.B.: On the complexity of numerical analysis. SIAM J. Comput.\u00a038(5), 1987\u20132006 (2009)","journal-title":"SIAM J. Comput."},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity - A Modern Approach, pp. 1\u2013579. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"key":"22_CR4","volume-title":"A compendium of BBP-type formulas for mathematical constants. Report","author":"D.H. Bailey","year":"2011","unstructured":"Bailey, D.H.: A compendium of BBP-type formulas for mathematical constants. Report. Lawrence Berkeley National Laboratory, Berkeley (2011)"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BF03024340","volume":"19","author":"D.H. Bailey","year":"1997","unstructured":"Bailey, D.H., Borwein, J.M., Borwein, P.B., Plouffe, S.: The quest for pi. The Mathematical Intelligencer\u00a019(1), 50\u201357 (1997)","journal-title":"The Mathematical Intelligencer"},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1006\/jcss.2001.1764","volume":"63","author":"D.A.M. Barrington","year":"2001","unstructured":"Barrington, D.A.M., Kadau, P., Lange, K.-J., McKenzie, P.: On the complexity of some problems on groups input as multiplication tables. J. Comput. Syst. Sci.\u00a063(2), 186\u2013200 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"22_CR7","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1137\/0217069","volume":"17","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Feig, E., Kozen, D., Tiwari, P.: A fast parallel algorithm for determining all roots of a polynomial with real roots. SIAM J. Comput.\u00a017(6), 1081\u20131092 (1988)","journal-title":"SIAM J. Comput."},{"key":"22_CR8","volume-title":"An Introduction to the Theory of Numbers","author":"G.H. Hardy","year":"1979","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 5th edn. Oxford Univ. Press, New York (1979)","edition":"5"},{"issue":"4","key":"22_CR9","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., Mix Barrington, D.A.: Uniform constant-depth threshold circuits for division and iterated multiplication. J. Comput. Syst. Sci.\u00a065(4), 695\u2013716 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR10","unstructured":"Jer\u00e1bek, E.: Root finding with threshold circuits. CoRR, abs\/1112.3925 (2011)"},{"issue":"1","key":"22_CR11","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."},{"key":"22_CR12","first-page":"1","volume":"62","author":"A. Markoff","year":"1889","unstructured":"Markoff, A.: Sur une question pos\u00e9e par Mendeleieff. Bulletin of the Academy of Sciences of St. Petersburg\u00a062, 1\u201324 (1889)","journal-title":"Bulletin of the Academy of Sciences of St. Petersburg"},{"issue":"2","key":"22_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1090\/S0002-9947-1938-1501946-0","volume":"43","author":"O. Ore","year":"1938","unstructured":"Ore, O.: On functions with bounded derivatives. Transactions of the American Mathematical Society\u00a043(2), 321\u2013326 (1938)","journal-title":"Transactions of the American Mathematical Society"},{"key":"22_CR14","first-page":"1","volume":"2","author":"K.F. Roth","year":"1955","unstructured":"Roth, K.F.: Rational approximations to algebraic numbers. Mathematika. A Journal of Pure and Applied Mathematics\u00a02, 1\u201320 (1955)","journal-title":"Mathematika. A Journal of Pure and Applied Mathematics"},{"key":"22_CR15","doi-asserted-by":"publisher","DOI":"10.1515\/9783110889055","volume-title":"Transcendental Numbers","author":"A.B. Shidlovskii","year":"1989","unstructured":"Shidlovskii, A.B.: Transcendental Numbers. de Gruyter, New York (1989)"},{"issue":"42","key":"22_CR16","first-page":"230","volume":"2","author":"A.M. Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers, with an application to the entscheidungs problem. Proc. London Math. Soc.\u00a02(42), 230\u2013265 (1936)","journal-title":"Proc. London Math. Soc."},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Vollmer, H.: Introduction to circuit complexity - a uniform approach. Texts in theoretical computer science. Springer (1999)","DOI":"10.1007\/978-3-662-03927-4"},{"key":"22_CR18","unstructured":"Yap, C.: Fundamental Problems in Algorithmic Algebra. Oxford University Press (2000)"},{"key":"22_CR19","unstructured":"Yap, C.: Pi is in log space (June 2010) (manuscript)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:22:47Z","timestamp":1620127367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}