乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:38:10Z","timestamp":1725471490124},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540360759"},{"type":"electronic","value":"9783540360766"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11792086_15","type":"book-chapter","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T13:48:35Z","timestamp":1159969715000},"page":"193-207","source":"Crossref","is-referenced-by-count":8,"title":["The Pseudosquares Prime Sieve"],"prefix":"10.1007","author":[{"given":"Jonathan P.","family":"Sorenson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P (2003), http:\/\/www.cse.iitk.ac.in\/news\/primality_v3.pdf"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1090\/S0025-5718-03-01501-1","volume":"73","author":"A.O.L. Atkin","year":"2004","unstructured":"Atkin, A.O.L., Bernstein, D.J.: Prime sieves using binary quadratic forms. Mathematics of Computation\u00a073, 1023\u20131030 (2004)","journal-title":"Mathematics of Computation"},{"key":"15_CR3","volume-title":"Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms","author":"E. Bach","year":"1985","unstructured":"Bach, E.: Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms. MIT Press, Cambridge (1985)"},{"issue":"203","key":"15_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1090\/S0025-5718-1993-1195432-5","volume":"61","author":"E. Bach","year":"1993","unstructured":"Bach, E., Huelsbergen, L.: Statistical evidence for small generating sets. Math. Comp.\u00a061(203), 69\u201382 (1993)","journal-title":"Math. Comp."},{"key":"15_CR5","volume-title":"Algorithmic Number Theory","author":"E. Bach","year":"1996","unstructured":"Bach, E., Shallit, J.O.: Algorithmic Number Theory, vol.\u00a01. MIT Press, Cambridge (1996)"},{"issue":"4","key":"15_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01228507","volume":"9","author":"E. Bach","year":"1993","unstructured":"Bach, E., Sorenson, J.P.: Sieve algorithms for perfect power testing. Algorithmica\u00a09(4), 313\u2013328 (1993)","journal-title":"Algorithmica"},{"issue":"223","key":"15_CR7","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1090\/S0025-5718-98-00952-1","volume":"67","author":"D.J. Bernstein","year":"1998","unstructured":"Bernstein, D.J.: Detecting perfect powers in essentially linear time. Math. Comp.\u00a067(223), 1253\u20131283 (1998)","journal-title":"Math. Comp."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: Proving primality in essentially quartic time. Mathematics of Computation (to appear, 2006), http:\/\/cr.yp.to\/papers.html#quartic","DOI":"10.1090\/S0025-5718-06-01786-8"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lenstra Jr., H.W., Pila, J.: Detecting perfect powers by factoring into coprimes. Mathematics of Computation (to appear, 2006)","DOI":"10.1090\/S0025-5718-06-01837-0"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0020-0190(96)00099-3","volume":"59","author":"B. Dunten","year":"1996","unstructured":"Dunten, B., Jones, J., Sorenson, J.P.: A space-efficient fast prime number sieve. Information Processing Letters\u00a059, 79\u201384 (1996)","journal-title":"Information Processing Letters"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/10722028_17","volume-title":"Algorithmic Number Theory","author":"W.F. Galway","year":"2000","unstructured":"Galway, W.F.: Dissecting a sieve to cut its need for space. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 297\u2013312. Springer, Heidelberg (2000)"},{"key":"15_CR12","unstructured":"Galway, W.F.: Analytic Computation of the Prime-Counting Function. PhD thesis, University of Illinois at Urbana-Champaign (2004), Available at: http:\/\/www.math.uiuc.edu\/~galway\/PhD_Thesis\/"},{"key":"15_CR13","unstructured":"Granlund, T.: The Gnu multiple precision arithmetic library, edition 4.1.3 (2004), http:\/\/www.swox.se\/gmp\/manual"},{"key":"15_CR14","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 University Press, Oxford (1979)","edition":"5"},{"issue":"213","key":"15_CR15","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1090\/S0025-5718-96-00678-3","volume":"65","author":"R.F. Lukes","year":"1996","unstructured":"Lukes, R.F., Patterson, C.D., Williams, H.C.: Some results on pseudosquares. Math. Comp.\u00a065(213), 361\u2013372, S25\u2013S27 (1996)","journal-title":"Math. Comp."},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","volume":"13","author":"G. Miller","year":"1976","unstructured":"Miller, G.: Riemann\u2019s hypothesis and tests for primality. Journal of Computer and System Sciences\u00a013, 300\u2013317 (1976)","journal-title":"Journal of Computer and System Sciences"},{"issue":"151","key":"15_CR17","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.2307\/2006210","volume":"35","author":"C. Pomerance","year":"1980","unstructured":"Pomerance, C., Selfridge, J.L., Wagstaff Jr., S.S.: The pseudoprimes to 25 \u00b7109. Math. Comp.\u00a035(151), 1003\u20131026 (1980)","journal-title":"Math. Comp."},{"issue":"1","key":"15_CR18","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/358527.358540","volume":"24","author":"P. Pritchard","year":"1981","unstructured":"Pritchard, P.: A sublinear additive sieve for finding prime numbers. Communications of the ACM\u00a024(1), 18\u201323,772 (1981)","journal-title":"Communications of the ACM"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/0196-6774(83)90014-7","volume":"4","author":"P. Pritchard","year":"1983","unstructured":"Pritchard, P.: Fast compact prime number sieves (among others). Journal of Algorithms\u00a04, 332\u2013344 (1983)","journal-title":"Journal of Algorithms"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M.O. Rabin","year":"1980","unstructured":"Rabin, M.O.: Probabilistic algorithm for testing primality. Journal of Number Theory\u00a012, 128\u2013138 (1980)","journal-title":"Journal of Number Theory"},{"key":"15_CR21","first-page":"213","volume":"4","author":"A. Schinzel","year":"1997","unstructured":"Schinzel, A.: On pseudosquares. New Trends in Prob. and Stat.\u00a04, 213\u2013220 (1997)","journal-title":"New Trends in Prob. and Stat."},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/0206006","volume":"6","author":"R. Solovay","year":"1977","unstructured":"Solovay, R., Strassen, V.: A fast Monte Carlo test for primality. SIAM Journal on Computing\u00a06, 84\u201385 (1977); Erratum in vol. 7, p. 118 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BFb0054861","volume-title":"Algorithmic Number Theory","author":"J.P. Sorenson","year":"1998","unstructured":"Sorenson, J.P.: Trading time for space in prime number sieves. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 179\u2013195. Springer, Heidelberg (1998)"},{"issue":"1","key":"15_CR24","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1006\/inco.1994.1082","volume":"144","author":"J.P. Sorenson","year":"1994","unstructured":"Sorenson, J.P., Parberry, I.: Two fast parallel prime number sieves. Information and Computation\u00a0144(1), 115\u2013130 (1994)","journal-title":"Information and Computation"},{"key":"15_CR25","volume-title":"The C++ Programming Language","author":"B. Stroustrup","year":"1991","unstructured":"Stroustrup, B.: The C++ Programming Language, 2nd edn. Addison-Wesley, Reading (1991)","edition":"2"},{"key":"#cr-split#-15_CR26.1","unstructured":"Williams, H.C.: ??douard Lucas and primality testing. Canadian Mathematical Society Series of Monographs and Advanced Texts, vol.??22. John Wiley & Sons Inc., New York (1998);"},{"key":"#cr-split#-15_CR26.2","unstructured":"A Wiley-Interscience Publication"},{"key":"15_CR27","unstructured":"Wooding, K.: Development of a high-speed hybrid sieve architecture. Master\u2019s thesis, The University of Calgary, Calgary, Alberta (November 2003)"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/11792086_16","volume-title":"Algorithmic Number Theory","author":"K. Wooding","year":"2006","unstructured":"Wooding, K., Williams, H.C.: Doubly-focused enumeration of pseudosquares and pseudocubes. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 208\u2013221. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11792086_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:10:01Z","timestamp":1605643801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11792086_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540360759","9783540360766"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11792086_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}