{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:47:55Z","timestamp":1742921275693,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319751719"},{"type":"electronic","value":"9783319751726"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-75172-6_12","type":"book-chapter","created":{"date-parts":[[2018,1,30]],"date-time":"2018-01-30T11:23:02Z","timestamp":1517311382000},"page":"132-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Periods $$\\ldots $$"],"prefix":"10.1007","author":[{"given":"Junhee","family":"Cho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sewon","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Ziegler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1080\/10586458.2017.1284625","volume":"26","author":"DH Bailey","year":"2017","unstructured":"Bailey, D.H.: Jonathan Borwein: experimental mathematician. Exp. Math. 26(2), 125\u2013129 (2017)","journal-title":"Exp. Math."},{"issue":"6","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1137\/S009753970444435X","volume":"35","author":"P Berenbrink","year":"2006","unstructured":"Berenbrink, P., Czumaj, A., Steger, A., V\u00f6cking, B.: Balanced allocations: the heavily loaded case. SIAM J. Comput. 35(6), 1350\u20131385 (2006)","journal-title":"SIAM J. Comput."},{"key":"12_CR3","series-title":"Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-1-4471-0717-0_6","volume-title":"Combinatorics, Computability and Logic","author":"V Becher","year":"2001","unstructured":"Becher, V., Daicz, S., Chaitin, G.: A highly random number. In: Calude, C.S., Dinneen, M.J., Sburlan, S. (eds.) Combinatorics, Computability and Logic. Discrete Mathematics and Theoretical Computer Science, pp. 55\u201368. Springer, London (2001). https:\/\/doi.org\/10.1007\/978-1-4471-0717-0_6"},{"key":"12_CR4","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"130","volume-title":"32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)","author":"V Brattka","year":"2015","unstructured":"Brattka, V., Gherardi, G., H\u00f6lzl, R.: Las Vegas computability and algorithmic randomness. In: Mayr, E.W., Ollinger, N. (eds.) 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), vol. 30, pp. 130\u2013142. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2015)"},{"key":"12_CR5","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Heintz, J., Recio, T., Roy, M.-F.: Algorithms in real algebraic geometry and applications to computational geometry. In: Goodman, J.E., Pollack, R., Steiger, W. (eds.) Discrete and Computational Geometry: Papers from the DIMACS Special Year. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 6, pp. 137\u2013164. DIMACS\/AMS (1990)","DOI":"10.1090\/dimacs\/006\/08"},{"key":"12_CR7","unstructured":"Kanada, Y.: \n                    \n                  . J. Math. Cult. 1(1), 72\u201383 (2003)"},{"key":"12_CR8","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"D Kratsch","year":"2010","unstructured":"Kratsch, D., Fomin, F.V.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16533-7"},{"key":"12_CR9","series-title":"Progress in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"K-I Ko","year":"1991","unstructured":"Ko, K.-I.: Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkh\u00e4user, Boston (1991). https:\/\/doi.org\/10.1007\/978-1-4684-6802-1"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1006\/jcom.1999.0502","volume":"15","author":"P Koiran","year":"1999","unstructured":"Koiran, P.: The real dimension problem is NPR-complete. J. Complex. 15(2), 227\u2013238 (1999)","journal-title":"J. Complex."},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1112\/jlms\/s2-36.2.193","volume":"36","author":"M Kutylowski","year":"1987","unstructured":"Kutylowski, M.: Small Grzegorczyk classes. J. Lond. Math. Soc. 36(2), 193\u2013210 (1987)","journal-title":"J. Lond. Math. Soc."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/978-3-642-56478-9_39","volume-title":"Mathematics Unlimited \u2013 2001 and Beyond","author":"M Kontsevich","year":"2001","unstructured":"Kontsevich, M., Zagier, D.: Periods. In: Engquist, B., Schmid, W. (eds.) Mathematics Unlimited \u2013 2001 and Beyond, pp. 771\u2013808. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-3-319-50926-6_12"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Meer, K.: Optimization and approximation problems related to polynomial system solving. In: Proceedings of the 2nd Conference on Computability in Europe (CiE 2006), pp. 360\u2013367 (2006)","DOI":"10.1007\/11780342_38"},{"key":"12_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing - Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing - Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York (2005)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45335-0_14","volume-title":"Computability and Complexity in Analysis","author":"NT M\u00fcller","year":"2001","unstructured":"M\u00fcller, N.T.: The iRRAM: exact arithmetic in C++. In: Blanck, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol. 2064, pp. 222\u2013252. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45335-0_14"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1007\/978-3-662-44199-2_107","volume-title":"Mathematical Software \u2013 ICMS 2014","author":"NT M\u00fcller","year":"2014","unstructured":"M\u00fcller, N.T., Ziegler, M.: From calculus to algorithms without errors. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol. 8592, pp. 718\u2013724. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44199-2_107"},{"key":"12_CR17","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)"},{"key":"12_CR18","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42312-8","volume-title":"What is the Genus?","author":"P Popescu-Pampu","year":"2016","unstructured":"Popescu-Pampu, P.: What is the Genus?. LNM, vol. 2162. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42312-8"},{"issue":"1","key":"12_CR19","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1090\/S0002-9947-1963-0158822-2","volume":"106","author":"RW Ritchie","year":"1963","unstructured":"Ritchie, R.W.: Classes of predictably computable functions. Trans. Am. Math. Soc. 106(1), 139\u2013173 (1963)","journal-title":"Trans. Am. Math. Soc."},{"issue":"6","key":"12_CR20","first-page":"861","volume":"14","author":"D Skordev","year":"2008","unstructured":"Skordev, D.: On the subrecursive computability of several famous constants. J. Univers. Comput. Sci. 14(6), 861\u2013875 (2008)","journal-title":"J. Univers. Comput. Sci."},{"issue":"4","key":"12_CR21","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1093\/logcom\/exq050","volume":"22","author":"D Skordev","year":"2012","unstructured":"Skordev, D., Weiermann, A., Georgiev, I.: \n$$M^2$$\n-computable real numbers. J. Logic Comput. 22(4), 899\u2013925 (2012)","journal-title":"J. Logic Comput."},{"issue":"2","key":"12_CR22","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"42","author":"AM Turing","year":"1937","unstructured":"Turing, A.M.: On computable numbers, with an application to the \u201cEntscheidungsproblem\u201d. Proc. Lond. Math. Soc. 42(2), 230\u2013265 (1937)","journal-title":"Proc. Lond. Math. Soc."},{"key":"12_CR23","first-page":"43","volume":"3","author":"K Tent","year":"2010","unstructured":"Tent, K., Ziegler, M.: Computable functions of reals. M\u00fcnster J. Math. 3, 43\u201365 (2010)","journal-title":"M\u00fcnster J. Math."},{"key":"12_CR24","unstructured":"Viu-Sos, J.: A semi-canonical reduction for periods of Kontsevich-Zagier. arXiv:1509.01097 (2017)"},{"key":"12_CR25","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-642-56999-9"},{"key":"12_CR26","unstructured":"Yoshinaka, M.: Periods and elementary real numbers. arXiv:0805.0349 (2008)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75172-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:40:17Z","timestamp":1710344417000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-75172-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319751719","9783319751726"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75172-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dhaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangladesh","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 March 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cse.buet.ac.bd\/walcom2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}