乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:28:09Z","timestamp":1725456489482},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602163"},{"type":"electronic","value":"9783540447337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0030859","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T03:51:40Z","timestamp":1133409100000},"page":"400-409","source":"Crossref","is-referenced-by-count":8,"title":["Sets computable in polynomial time on average"],"prefix":"10.1007","author":[{"given":"Rainer","family":"Schuler","sequence":"first","affiliation":[]},{"given":"Tomoyuki","family":"Yamakami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"46_CR1","volume-title":"Structural complexity I+II","author":"J.L. Balc\u00e1zar","year":"1989","unstructured":"J.L. Balc\u00e1zar, J. D\u00edaz, and J. Gabarr\u00f3, Structural complexity I+II, Springer, Berlin, 1989(I), 1990(II)."},{"key":"46_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01699457","volume":"18","author":"J.L. Balc\u00e1zar","year":"1985","unstructured":"J.L. Balc\u00e1zar and U. Sch\u00f6ning, Bi-immune sets for complexity classes, Math. Systems Theory, 18 (1985), pp.1\u201310.","journal-title":"Math. Systems Theory"},{"doi-asserted-by":"crossref","unstructured":"J. Belanger and J. Wang, Isomorphisms of NP complete problems on random instances, in Proc., 8th Conf. on Structure in Complexity Theory, 1993, pp.65\u201374.","key":"46_CR3","DOI":"10.1109\/SCT.1993.336540"},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0022-0000(92)90019-F","volume":"44","author":"S. Ben-David","year":"1992","unstructured":"S. Ben-David, B. Chor, O. Goldreich, and M. Luby, On the theory of average case complexity, J. Comput. System Sci., 44 (1992), pp.193\u2013219.","journal-title":"J. Comput. System Sci."},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1137\/0210008","volume":"10","author":"C.H. Bennett","year":"1981","unstructured":"C.H. Bennett and J. Gill, Relative to a random oracle A, PA \u2260 NPA \u2260 co-NPA\nwith probability 1, SIAM J. Comput., 10 (1981), pp.96\u2013113.","journal-title":"SIAM J. Comput."},{"key":"46_CR6","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1137\/0220033","volume":"20","author":"J. Goldsmith","year":"1991","unstructured":"J. Goldsmith, L.A. Hemachandra, D. Joseph, and P. Young, Near-testable sets, SIAM. J. Comput., 20 (1991), pp.506\u2013523.","journal-title":"SIAM. J. Comput."},{"key":"46_CR7","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/0022-0000(91)90007-R","volume":"42","author":"Y. Gurevich","year":"1991","unstructured":"Y. Gurevich, Average case complexity, J. Comput. System Sci., 42 (1991), pp.346\u2013398.","journal-title":"J. Comput. System Sci."},{"doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and L. Levin, No better ways to generate hard NP instances than picking uniformly at random, in Proc., 31st FOCS, 1990, pp.812\u2013821.","key":"46_CR8","DOI":"10.1109\/FSCS.1990.89604"},{"key":"46_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0304-3975(82)80003-0","volume":"20","author":"K.I. Ko","year":"1982","unstructured":"K.I. Ko and H. Friedman, Computational complexity of real functions, Theoret. Comput. Sci., 20 (1982), pp.323\u2013352.","journal-title":"Theoret. Comput. Sci."},{"key":"46_CR10","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1137\/0210061","volume":"10","author":"K.I. Ko","year":"1981","unstructured":"K.I. Ko and D. Moore, Completeness, approximation and density, SIAM J. Comput., 10 (1981), pp.787\u2013796.","journal-title":"SIAM J. Comput."},{"key":"46_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1137\/0215020","volume":"15","author":"L. Levin","year":"1986","unstructured":"L. Levin, Average case complete problems, SIAM J. Comput., 15 (1986), pp.285\u2013286. A preliminary version appeared in Proc., 16th STOC, 1984, p.465.","journal-title":"SIAM J. Comput."},{"key":"46_CR12","first-page":"392","volume":"629","author":"E. Mayordomo","year":"1992","unstructured":"E. Mayordomo, Almost every set in exponential time is P-bi-immune, in Proc., 17th MFCS, LNCS, Vol.629, 1992, pp.392\u2013400.","journal-title":"LNCS"},{"unstructured":"A.R. Meyer and M. Paterson, With what frequency are apparently intractable problems difficult, Technical Report TM-126, MIT, 1979.","key":"46_CR13"},{"key":"46_CR14","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/S0019-9958(86)80024-9","volume":"70","author":"P. Orponen","year":"1986","unstructured":"P. Orponen and U. Sch\u00f6ning, On the density and complexity of polynomial cores for intractable sets, Inform. Control, 70 (1986), pp.54\u201368.","journal-title":"Inform. Control"},{"unstructured":"R. Schuler, On average polynomial time, Technical Report, Universit\u00e4t Ulm, 1994.","key":"46_CR15"},{"key":"46_CR16","first-page":"128","volume":"652","author":"R. Schuler","year":"1992","unstructured":"R. Schuler and T. Yamakami, Structural average case complexity, in Proc., 12th FST & TCS, LNCS, Vol.652, 1992, pp 128\u2013139.","journal-title":"LNCS"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T02:01:35Z","timestamp":1549418495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602163","9783540447337"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0030859","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}