{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:55:41Z","timestamp":1725602141601},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232824"},{"type":"electronic","value":"9783642232831"}],"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-23283-1_15","type":"book-chapter","created":{"date-parts":[[2011,8,24]],"date-time":"2011-08-24T02:30:27Z","timestamp":1314153027000},"page":"218-238","source":"Crossref","is-referenced-by-count":0,"title":["Emulating Primality with Multiset Representations of Natural Numbers"],"prefix":"10.1007","author":[{"given":"Paul","family":"Tarau","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"15_CR1","first-page":"83","volume":"81","author":"P. C\u00e9gielski","year":"2007","unstructured":"C\u00e9gielski, P., Richard, D., Vsemirnov, M.: On the additive theory of prime numbers. Fundam. Inform.\u00a081(1-3), 83\u201396 (2007)","journal-title":"Fundam. Inform."},{"key":"15_CR2","volume-title":"Prime Numbers\u2013a Computational Approach","author":"R. Crandall","year":"2005","unstructured":"Crandall, R., Pomerance, C.: Prime Numbers\u2013a Computational Approach, 2nd edn. Springer, New York (2005)","edition":"2"},{"key":"15_CR3","unstructured":"Riemann, B.: Ueber die anzahl der primzahlen unter einer gegebenen gr\u00f6sse. Monatsberichte der Berliner Akademie (November 1859)"},{"key":"15_CR4","first-page":"234","volume-title":"STOC","author":"G.L. Miller","year":"1975","unstructured":"Miller, G.L.: Riemann\u2019s hypothesis and tests for primality. In: STOC, pp. 234\u2013239. ACM, New York (1975)"},{"issue":"6","key":"15_CR5","doi-asserted-by":"publisher","first-page":"534","DOI":"10.2307\/2695443","volume":"109","author":"J.C. Lagarias","year":"2002","unstructured":"Lagarias, J.C.: An Elementary Problem Equivalent to the Riemann Hypothesis. The American Mathematical Monthly\u00a0109(6), 534\u2013543 (2002)","journal-title":"The American Mathematical Monthly"},{"key":"15_CR6","first-page":"341","volume":"60","author":"B. Conrey","year":"2003","unstructured":"Conrey, B.: The Riemann Hypothesis. Not. Amer. Math. Soc.\u00a060, 341\u2013353 (2003)","journal-title":"Not. Amer. Math. Soc."},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02985392","volume":"26","author":"G. Chaitin","year":"2004","unstructured":"Chaitin, G.: Thoughts on the riemann hypothesis. Math. Intelligencer\u00a026(1), 4\u20137 (2004)","journal-title":"Math. Intelligencer"},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1109\/TIT.2004.840866","volume":"51","author":"N. Pippenger","year":"2005","unstructured":"Pippenger, N.: The average amount of information lost in multiplication. IEEE Transactions on Information Theory\u00a051(2), 684\u2013687 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-02614-0_17","volume-title":"Intelligent Computer Mathematics","author":"P. Tarau","year":"2009","unstructured":"Tarau, P.: A Groupoid of Isomorphic Data Transformations. In: Carette, J., Dixon, L., Coen, C.S., Watt, S.M. (eds.) MKM 2009, Held as Part of CICM 2009. LNCS, vol.\u00a05625, pp. 170\u2013185. Springer, Heidelberg (2009)"},{"key":"15_CR10","first-page":"1898","volume-title":"Proceedings of ACM SAC 2009","author":"P. Tarau","year":"2009","unstructured":"Tarau, P.: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell. In: Proceedings of ACM SAC 2009, pp. 1898\u20131903. ACM, New York (2009)"},{"key":"15_CR11","first-page":"171","volume-title":"Proceedings of 11th International ACM SIGPLAN Symposium PPDP 2009","author":"P. Tarau","year":"2009","unstructured":"Tarau, P.: An Embedded Declarative Data Transformation Language. In: Proceedings of 11th International ACM SIGPLAN Symposium PPDP 2009, Coimbra, Portugal, pp. 171\u2013182. ACM, New York (2009)"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01700692","volume":"38","author":"K. G\u00f6del","year":"1931","unstructured":"G\u00f6del, K.: \u00dcber formal unentscheidbare S\u00e4tze der Principia Mathematica und verwandter Systeme I. Monatshefte f\u00fcr Mathematik und Physik\u00a038, 173\u2013198 (1931)","journal-title":"Monatshefte f\u00fcr Mathematik und Physik"},{"issue":"2","key":"15_CR13","first-page":"73","volume":"52","author":"D. Singh","year":"2007","unstructured":"Singh, D., Ibrahim, A.M., Yohanna, T., Singh, J.N.: An overview of the applications of multisets. Novi Sad J. Math\u00a052(2), 73\u201392 (2007)","journal-title":"Novi Sad J. Math"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-06841-4_69","volume-title":"Automata, Languages and Programming","author":"J. Hartmanis","year":"1974","unstructured":"Hartmanis, J., Baker, T.P.: On Simple Goedel Numberings and Translations. In: Loeckx, J. (ed.) ICALP 1974. LNCS, vol.\u00a014, pp. 301\u2013316. Springer, Heidelberg (1974)"},{"key":"15_CR15","first-page":"131","volume-title":"PPDP 2010: Proceedings of the 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming","author":"P. Tarau","year":"2010","unstructured":"Tarau, P.: Declarative modeling of finite mathematics. In: PPDP 2010: Proceedings of the 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, pp. 131\u2013142. ACM, New York (2010)"},{"key":"15_CR16","unstructured":"Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences (2010), published electronically at http:\/\/www.research.att.com\/~njas\/sequences"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1155\/S1073792898000592","volume":"19","author":"A. Granville","year":"1998","unstructured":"Granville, A.: ABC allows us to count squarefrees. International Mathematics Research Notices\u00a0(19), 991 (1998)","journal-title":"International Mathematics Research Notices"},{"key":"15_CR18","first-page":"138","volume":"357","author":"A.M. Odlyzko","year":"1985","unstructured":"Odlyzko, A.M., Te Riele, A.M., Disproof, H.J.J.: of the Mertens conjecture. J. Reine Angew. Math.\u00a0357, 138\u2013160 (1985)","journal-title":"J. Reine Angew. Math."},{"key":"15_CR19","volume-title":"Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics","author":"J. Derbyshire","year":"2004","unstructured":"Derbyshire, J.: Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics. Penguin, New York (2004)"},{"issue":"4","key":"15_CR20","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1305\/ndjfl\/1193667707","volume":"48","author":"R. Kaye","year":"2007","unstructured":"Kaye, R., Wong, T.L.: On Interpretations of Arithmetic and Set Theory. Notre Dame J. Formal Logic\u00a048(4), 497\u2013510 (2007)","journal-title":"Notre Dame J. Formal Logic"},{"key":"15_CR21","unstructured":"Avigad, J.: The Combinatorics of Propositional Provability. In: ASL Winter Meeting, San Diego (January 1997)"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1002\/malq.200610026","volume":"53","author":"L. Kirby","year":"2007","unstructured":"Kirby, L.: Addition and multiplication of sets. Math. Log. Q.\u00a053(1), 52\u201365 (2007)","journal-title":"Math. Log. Q."},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-45138-9_51","volume-title":"Mathematical Foundations of Computer Science 2003","author":"C. Mart\u00ednez","year":"2003","unstructured":"Mart\u00ednez, C., Molinero, X.: Generic algorithms for the generation of combinatorial objects. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 572\u2013581. Springer, Heidelberg (2003)"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0196-6774(90)90030-I","volume":"11","author":"F. Ruskey","year":"1990","unstructured":"Ruskey, F., Proskurowski, A.: Generating binary trees by transpositions. J. Algorithms\u00a011, 68\u201384 (1990)","journal-title":"J. Algorithms"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Tarau, P.: Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell, p. 150 (January 2009), Unpublished draft, http:\/\/arXiv.org\/abs\/0808.2953 , updated version at http:\/\/logic.cse.unt.edu\/tarau\/research\/2010\/ISO.pdf","DOI":"10.1145\/1529282.1529706"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: 4th ACM Symp. Principles of Programming Languages, pp. 238\u2013278 (1977)","DOI":"10.1145\/512950.512973"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23283-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T15:41:32Z","timestamp":1592840492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23283-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232824","9783642232831"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23283-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}