{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T15:26:47Z","timestamp":1726068407446},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030416713"},{"type":"electronic","value":"9783030416720"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-41672-0_5","type":"book-chapter","created":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T07:03:04Z","timestamp":1582182184000},"page":"57-66","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Promise Problems on Probability Distributions"],"prefix":"10.1007","author":[{"given":"Jan-Hendrik","family":"Lorenz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"Sch\u00f6ning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,21]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0019-9958(84)80056-X","volume":"61","author":"S Even","year":"1984","unstructured":"Even, S., Selman, A.L., Yacobi, Y.: The complexity of promise problems with applications to public-key cryptography. Inf. Control 61(2), 159\u2013173 (1984)","journal-title":"Inf. Control"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/11685654_12","volume-title":"Theoretical Computer Science","author":"O Goldreich","year":"2006","unstructured":"Goldreich, O.: On promise problems: a survey. In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds.) Theoretical Computer Science. LNCS, vol. 3895, pp. 254\u2013290. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11685654_12"},{"key":"5_CR3","unstructured":"Gomes, C.P., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: National Conference on Artificial Intelligence, pp. 431\u2013437. AAAI Press (1998)"},{"key":"5_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"K Ko","year":"1991","unstructured":"Ko, K.: Complexity Theory of Real Functions. Birkh\u00e4user, Boston (1991)"},{"key":"5_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0333-9","volume-title":"The Graph Isomorphism Problem - Its Structural Complexity","author":"J K\u00f6bler","year":"1993","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: The Graph Isomorphism Problem - Its Structural Complexity. Birkh\u00e4user, Boston (1993)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-030-19955-5_22","volume-title":"Computer Science \u2013 Theory and Applications","author":"J-H Lorenz","year":"2019","unstructured":"Lorenz, J.-H.: On the complexity of restarting. In: van Bevern, R., Kucherov, G. (eds.) CSR 2019. LNCS, vol. 11532, pp. 250\u2013261. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-19955-5_22"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speed-up of las vegas algorithms. Inf. Process. Lett. 47(4), 173\u2013180 (1993)","journal-title":"Inf. Process. Lett."},{"key":"5_CR8","unstructured":"Sch\u00f6ning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: 40th Annual Symposium on Foundations of Computer Science, pp. 410\u2013414. IEEE (1999)"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(88)90030-2","volume":"78","author":"AL Selman","year":"1988","unstructured":"Selman, A.L.: Promise problems complete for complexity classes. Inf. Comput. 78(2), 87\u201398 (1988)","journal-title":"Inf. Comput."},{"key":"5_CR10","unstructured":"Toda, S.: The complexity of finding medians. In: Proceedings 31th Annual Symposium on Foundations of Computer Science, pp. 778\u2013787. IEEE (1990)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/0220053","volume":"20","author":"S Toda","year":"1991","unstructured":"Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20, 865\u2013877 (1991)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Complexity and Approximation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-41672-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T07:03:37Z","timestamp":1582182217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-41672-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030416713","9783030416720"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-41672-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"21 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}