乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:10:04Z","timestamp":1736104204249,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626169"},{"type":"electronic","value":"9783540683421"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","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":[[1997]]},"DOI":"10.1007\/bfb0023455","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:06:33Z","timestamp":1132383993000},"page":"141-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MODp-tests, almost independence and small probability spaces"],"prefix":"10.1007","author":[{"given":"Claudia","family":"Bertram-Kretzberg","sequence":"first","affiliation":[]},{"given":"Hanno","family":"Lefmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1985","unstructured":"N. Alon, L. Babai and A. Itai, A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem, J. Alg. 7, 1985, 567\u2013583.","journal-title":"J. Alg."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/18.119713","volume":"38","author":"N. Alon","year":"1992","unstructured":"N. Alon, J. Bruck, J. Naor, M. Naor and R. Roth, Construction of Asymptotically-Good Low-Rate Error-Correcting Codes Through Pseudo-Random Graphs, IEEE Trans. Inf. Th. 38, 1992, 509\u2013516.","journal-title":"IEEE Trans. Inf. Th."},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"N. Alon, O. Goldreich, J. H\u00e5stad and R. Peralta, Simple Constructions of Almost k-wise Independent Random Variables, Random Structures & Algorithms 3, 1992, 289\u2013304. Addendum: Random Structures & Algorithms 4, 1993, 119\u2013120.","journal-title":"Random Structures & Algorithms"},{"key":"12_CR4","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"N. Alon and J. Spencer, The Probabilistic Method, Wiley & Sons, New York, 1992."},{"key":"12_CR5","unstructured":"Y. Azar, R. Motwani and J. Naor, Approximating Probability Distributions using Small Sample Spaces, preprint, 1995."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"L. Babai, P. Frankl and J. Simon, Complexity Classes in Communication Complexity Theory, Proc. 27th FOCS, 1986, 337\u2013347.","DOI":"10.1109\/SFCS.1986.15"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"J. Beck and W. Chen, Irregularities of Distribution, Cambridge Univ. Press, 1987.","DOI":"10.1017\/CBO9780511565984"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1145\/115234.115347","volume":"38","author":"B. Berger","year":"1991","unstructured":"B. Berger and J. Rompel, Simulating (log n) c -wise Independence in NC, J. ACM 38, 1991, 1026\u20131046.","journal-title":"J. ACM"},{"key":"12_CR9","unstructured":"C. Bertram-Kretzberg, TH-MOD p -circuits, preprint, 1996."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"S. Chari, P. Rohatgi and A. Srinivasan, Improved Algorithms via Approximations of Probability Distributions, Proc. 26th STOC, 1996, 584\u2013592.","DOI":"10.1145\/195058.195411"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02125347","volume":"9","author":"F. R. K. Chung","year":"1989","unstructured":"F. R. K. Chung, R. L. Graham and R. M. Wilson, Quasi-Random Graphs, Combinatorica 9, 1989, 345\u2013362.","journal-title":"Combinatorica"},{"key":"12_CR12","volume-title":"M. Sc. thesis","author":"G. Even","year":"1991","unstructured":"G. Even, Construction of Small Probability Spaces for Deterministic Simulation, M. Sc. thesis, Technion, Haifa, Israel, 1991."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"G. Even, O. Goldreich, M. Luby, N. Nisan and B. Veli\u010dkovi\u0107, Approximations of General Independent Distributions, Proc. 24th STOC, 1992, 10\u201316.","DOI":"10.1145\/129712.129714"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0020-0190(93)90076-L","volume":"47","author":"J. H\u00e5stad","year":"1993","unstructured":"J. H\u00e5stad, S. Phillips and S. Safra, A Well Characterized Approximation Problem, Inf. Proc. Lett. 47, 1993, 301\u2013305.","journal-title":"Inf. Proc. Lett."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"H. Karloff and Y. Mansour, On Construction of k-wise Independent Random Variables, Proc. 24th STOC, 1994, 564\u2013573.","DOI":"10.1145\/195058.195409"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"M. Krause and P. Pudl\u00e1k, On the Computational Power of Depth-2 Circuits with Threshold Modulo Gates, Proc. 26th STOC, 1994, 48\u201357.","DOI":"10.1145\/195058.195103"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"A. Lubotzky, R. Phillips and P. Sarnak, Ramanujan Graphs, Combinatorica 8, 1988, 261\u2013277.","journal-title":"Combinatorica"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/S0022-0000(05)80069-8","volume":"49","author":"R. Motwani","year":"1994","unstructured":"R. Motwani, J. Naor and M. Naor, The Probabilistic Method Yields Deterministic Parallel Algorithms, J. Comp. Sys. Sci. 49, 1994, 478\u2013516.","journal-title":"J. Comp. Sys. Sci."},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J. Naor","year":"1993","unstructured":"J. Naor and M. Naor, Small Bias Probability Spaces: Efficient Constructions and Applications, SIAM J. Comp. 22, 1993, 838\u2013856.","journal-title":"SIAM J. Comp."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"M. Naor, L. J. Schulman and A. Srinivasan, Splitters and Near-Optimal Derandomization, Proc. 36th FOCS, 1995, 182\u2013191.","DOI":"10.1109\/SFCS.1995.492475"},{"key":"12_CR21","volume-title":"CS Research Report TR 90-1","author":"R. Peralta","year":"1990","unstructured":"R. Peralta, On the Randomness Complexity of Algorithms, CS Research Report TR 90-1, University of Wiskonsin, Milwaukee, 1990."},{"key":"12_CR22","volume-title":"PhD thesis","author":"U. Vazirani","year":"1986","unstructured":"U. Vazirani, Randomness, Adversaries and Computation, PhD thesis, University of California, Berkeley, 1986."}],"container-title":["Lecture Notes in Computer Science","STACS 97"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T18:56:02Z","timestamp":1736103362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023455"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626169","9783540683421"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0023455","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"10 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}