{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:16:31Z","timestamp":1742994991736,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046170"},{"type":"electronic","value":"9783030046187"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04618-7_23","type":"book-chapter","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T20:47:58Z","timestamp":1542401278000},"page":"281-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory"],"prefix":"10.1007","author":[{"given":"Andr\u00e1s","family":"Farag\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,17]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01699457","volume":"18","author":"JL Balc\u00e0zar","year":"1985","unstructured":"Balc\u00e0zar, J.L., Sch\u00f6ning, U.: Bi-immune sets for complexity classes. Math. Syst. Theor. 18, 1\u201310 (1985)","journal-title":"Math. Syst. Theor."},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/0206023","volume":"6","author":"L Berman","year":"1977","unstructured":"Berman, L., Hartmanis, J.: On isomorphisms and density of NP and other complete sets. SIAM J. Comput. 6(2), 305\u2013322 (1977)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000004","volume":"2","author":"A Bogdanov","year":"2006","unstructured":"Bogdanov, A., Trevisan, L.: Average-Case Complexity. Found. Trends Theor. Comput. Sci. 2(1), 1\u2013106 (2006)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"23_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge University Press, Cambridge (2001)"},{"issue":"4","key":"23_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0201019","volume":"1","author":"RV Book","year":"1972","unstructured":"Book, R.V.: On languages accepted in polynomial time. SIAM J. Comput. 1(4), 281\u2013287 (1972)","journal-title":"SIAM J. Comput."},{"key":"23_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032916","volume-title":"Theory of Computational Complexity","author":"D-Z Du","year":"2000","unstructured":"Du, D.-Z., Ko, K.-I.: Theory of Computational Complexity. Wiley, Hoboken (2000)"},{"issue":"4","key":"23_CR7","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/2421119.2421135","volume":"43","author":"LA Hemaspaandra","year":"2012","unstructured":"Hemaspaandra, L.A., Williams, R.: An atypical survey of typical-case heuristic algorithms. ACM SIGACT News 43(4), 70\u201389 (2012). Complexity Theory Column 76","journal-title":"ACM SIGACT News"},{"issue":"5","key":"23_CR8","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/BF01184814","volume":"29","author":"LA Hemaspaandra","year":"1996","unstructured":"Hemaspaandra, L.A., Zimand, M.: Strong self-reducibility precludes strong immunity. Math. Syst. Theor. 29(5), 535\u2013548 (1996)","journal-title":"Math. Syst. Theor."},{"key":"23_CR9","unstructured":"Lutz, J.H., Mayordomo, E.: Twelve problems in resource-bounded measure. In: P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science: Entering the 21st Century, pp. 83\u2013101. World Scientific (2001)"},{"issue":"2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/0304-3975(94)00023-C","volume":"136","author":"E Mayordomo","year":"1994","unstructured":"Mayordomo, E.: Almost every set in exponential time is P-bi-immune. Theor. Comput. Sci. 136(2), 487\u2013506 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/2578043","volume":"57","author":"MY Vardi","year":"2014","unstructured":"Vardi, M.Y.: Boolean satisfiability: theory and engineering. Commun. ACM 57(3), 5 (2014)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04618-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:45:52Z","timestamp":1710344752000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04618-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046170","9783030046187"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04618-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aaim2018.wordpress.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}