{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T11:05:20Z","timestamp":1776769520420,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540646570","type":"print"},{"value":"9783540691136","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054856","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T12:06:06Z","timestamp":1154433966000},"page":"128-130","source":"Crossref","is-referenced-by-count":4,"title":["Bounding smooth integers (extended abstract)"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Bernstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,24]]},"reference":[{"key":"7_CR1","first-page":"50","volume-title":"The development of the number field sieve, Lecture Notes in Mathematics 1554","author":"J. P. Buhler","year":"1993","unstructured":"Joseph P. Buhler, Hendrik W. Lenstra, Jr., Carl Pomerance, Factoring integers with the number field sieve, in [10], 50\u201394."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-314X(83)90002-1","volume":"17","author":"E. R. Canfield","year":"1983","unstructured":"E. Rodney Canfield, Paul Erd\u00f3s, Carl Pomerance, On a problem of Oppenheim concerning \u201cfactorisatio numerorum\u201d, Journal of Number Theory 17 (1983), 1\u201328.","journal-title":"Journal of Number Theory"},{"key":"7_CR3","volume-title":"Algorithms and Combinatorics 13","author":"R. L. Graham","year":"1997","unstructured":"Ronald L. Graham, Jaroslav Ne\u0161et\u0158il, The mathematics of Paul Erd\u00f3s, volume 1, Algorithms and Combinatorics 13, Springer-Verlag, Berlin, 1997."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.2307\/2000573","volume":"296","author":"A. Hildebrand","year":"1986","unstructured":"Adolf Hildebrand, G\u00e9rald Tenenbaum, On integers free of large prime factors, Transactions of the AMS 296 (1986), 265\u2013290.","journal-title":"Transactions of the AMS"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"411","DOI":"10.5802\/jtnb.101","volume":"5","author":"A. Hildebrand","year":"1993","unstructured":"Adolf Hildebrand, G\u00e9rald Tenenbaum, Integers without large prime factors, Journal de Th\u00e9orie des Nombres de Bordeaux 5 (1993), 411\u2013484.","journal-title":"Journal de Th\u00e9orie des Nombres de Bordeaux"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"1729","DOI":"10.1090\/S0025-5718-97-00874-0","volume":"66","author":"S. Hunter","year":"1997","unstructured":"Simon Hunter, Jonathan Sorenson, Approximating the number of integers free of large prime factors, Mathematics of Computation 66 (1997), 1729\u20131741.","journal-title":"Mathematics of Computation"},{"key":"7_CR7","volume-title":"The art of computer programming, volume 1: fundamental algorithms","author":"D. E. Knuth","year":"1973","unstructured":"Donald E. Knuth, The art of computer programming, volume 1: fundamental algorithms, 2nd edition, Addison-Wesley, Reading, Massachusetts, 1973.","edition":"2nd edition"},{"key":"7_CR8","volume-title":"The art of computer programming, volume 2: seminumerical algorithms","author":"D. E. Knuth","year":"1981","unstructured":"Donald E. Knuth, The art of computer programming, volume 2: seminumerical algorithms, 2nd edition, Addison-Wesley, Reading, Massachusetts, 1981.","edition":"2nd edition"},{"key":"7_CR9","first-page":"176","volume-title":"The art of computer programming, volume 2: seminumerical algorithms","author":"S. Konyagin","year":"1981","unstructured":"Sergei Konyagin, Carl Pomerance, On primes recognizable in deterministic polynomial time, in [3], 176\u2013198.","edition":"2nd edition"},{"key":"7_CR10","volume-title":"The development of the number field sieve, Lecture Notes in Mathematics 1554","year":"1993","unstructured":"Arjen K. Lenstra, Hendrik W. Lenstra, Jr. (editors), The development of the number field sieve, Lecture Notes in Mathematics 1554, Springer-Verlag, Berlin, 1993."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054856","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T19:33:53Z","timestamp":1549913633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054856"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646570","9783540691136"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0054856","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}