{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:28:26Z","timestamp":1742959706385,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030199548"},{"type":"electronic","value":"9783030199555"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-19955-5_22","type":"book-chapter","created":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T23:10:01Z","timestamp":1561331401000},"page":"250-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Complexity of Restarting"],"prefix":"10.1007","author":[{"given":"Jan-Hendrik","family":"Lorenz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Arbelaez, A., Truchet, C., O\u2019Sullivan, B.: Learning sequential and parallel runtime distributions for randomized algorithms. In: ICTAI 2016, San Jose, California, USA, pp. 655\u2013662. IEEE (2016)","DOI":"10.1109\/ICTAI.2016.0105"},{"key":"22_CR2","unstructured":"Batu, T., Fortnow, L., Rubinfeld, R., Smith, W., White, P.: Testing that distributions are close. In: Proceedings of the Foundations of Computer Science, pp. 259\u2013269. IEEE (2000)"},{"key":"22_CR3","unstructured":"Biere, A., Fr\u00f6hlich, A.: Evaluating CDCL restart schemes. In: Proceedings of the International Workshop on Pragmatics of SAT (POS 2015) (2015)"},{"key":"22_CR4","volume-title":"Handbook of Satisfiability","author":"A Biere","year":"2009","unstructured":"Biere, A., Heule, M., van Maaren, H.: Handbook of Satisfiability. IOS Press, Amsterdam (2009)"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcss.1997.1550","volume":"56","author":"D Bshouty","year":"1998","unstructured":"Bshouty, D., Bshouty, N.H.: On interpolating arithmetic read-once formulas with exponentiation. J. Comput. Syst. Sci. 56(1), 112\u2013124 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR6","unstructured":"Canonne, C.: A survey on distribution testing: your data is big. But is it blue? In: Electronic Colloquium on Computational Complexity (ECCC), vol. 22, no. 63 (2015)"},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s00224-017-9785-6","volume":"62","author":"C Canonne","year":"2018","unstructured":"Canonne, C., Diakonikolas, I., Gouleakis, T., Rubinfeld, R.: Testing shape restrictions of discrete distributions. Theor. Comput. Syst. 62(1), 4\u201362 (2018)","journal-title":"Theor. Comput. Syst."},{"key":"22_CR8","unstructured":"Frost, D., Rish, I., Vila, L.: Summarizing CSP hardness with continuous probability distributions. In: Proceedings of the AAAI 1997\/IAAI 1997, pp. 327\u2013333. AAAI Press (1997)"},{"key":"22_CR9","unstructured":"Gomes, C., Selman, B., Kautz, H.: Boosting combinatorial search through randomization, pp. 431\u2013437. AAAI Press (1998)"},{"issue":"3","key":"22_CR10","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","volume":"36","author":"M Krentel","year":"1988","unstructured":"Krentel, M.: The complexity of optimization problems. J. Comput. Syst. Sci. 36(3), 490\u2013509 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-319-73117-9_35","volume-title":"SOFSEM 2018: Theory and Practice of Computer Science","author":"J-H Lorenz","year":"2018","unstructured":"Lorenz, J.-H.: Runtime distributions and criteria for restarts. In: Tjoa, A.M., Bellatreche, L., Biffl, S., van Leeuwen, J., Wiedermann, J. (eds.) SOFSEM 2018. LNCS, vol. 10706, pp. 493\u2013507. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73117-9_35"},{"issue":"4","key":"22_CR12","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 speedup of Las Vegas algorithms. Inf. Process. Lett. 47(4), 173\u2013180 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"22_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1109\/TKDE.2010.98","volume":"23","author":"O Mengshoel","year":"2011","unstructured":"Mengshoel, O., Wilkins, D., Roth, D.: Initialization and restart in stochastic local search: computing a most probable explanation in bayesian networks. IEEE Trans. Knowl. Data Eng. 23(2), 235\u2013247 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"22_CR14","unstructured":"Moorsel, A., Wolter, K.: Analysis and algorithms for restart. In: Proceedings of the First International Conference on the Quantitative Evaluation of Systems, pp. 195\u2013204 (2004)"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/11821069_64","volume-title":"Mathematical Foundations of Computer Science 2006","author":"A Pagourtzis","year":"2006","unstructured":"Pagourtzis, A., Zachos, S.: The complexity of counting functions with easy decision version. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 741\u2013752. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11821069_64"},{"key":"22_CR16","volume-title":"Computational Complexity","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison Wesley Pub. Co., Boston (1994)"},{"key":"22_CR17","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 (1999)"},{"issue":"2","key":"22_CR18","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of computing the permanent. Theoret. Comput. Sci. 8(2), 189\u2013201 (1979)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR19","series-title":"Texts in Theoretical Computer Science, An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity: A Uniform Approach","author":"H Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity: A Uniform Approach. Texts in Theoretical Computer Science, An EATCS Series. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-662-03927-4"},{"key":"22_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511752506","volume-title":"Complexity: Knots, Colourings and Countings","author":"D Welsh","year":"1993","unstructured":"Welsh, D.: Complexity: Knots, Colourings and Countings. Cambridge University Press, New York (1993)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19955-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:03:13Z","timestamp":1710349393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19955-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030199548","9783030199555"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19955-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}