{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:28Z","timestamp":1759638688605,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-58150-3_39","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"484-495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hardness of Sparse Sets and Minimal Circuit Size Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7192-2983","authenticated-orcid":false,"given":"Bin","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Adleman, L.: Two theorems on random polynomial time. In: Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, pp. 75\u201383 (1978)","key":"39_CR1","DOI":"10.1109\/SFCS.1978.37"},{"unstructured":"Allender, E., Hirahara, S.: New insights on the (non-)hardness of circuit minimization and related problems. In: 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, Aalborg, Denmark, August 21\u201325, 2017, pp. 54:1\u201354:14 (2017)","key":"39_CR2"},{"issue":"2","key":"39_CR3","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s00037-016-0124-0","volume":"26","author":"E Allender","year":"2017","unstructured":"Allender, E., Holden, D., Kabanets, V.: The minimum oracle circuit size problem. Comput. Complex. 26(2), 469\u2013496 (2017)","journal-title":"Comput. Complex."},{"key":"39_CR4","first-page":"118","volume":"26","author":"L Chen","year":"2019","unstructured":"Chen, L., Jin, C., Williams, R.: Hardness magnification for all sparse NP languages. Electron. Colloq. Comput. Complex. 26, 118 (2019)","journal-title":"Electron. Colloq. Comput. Complex."},{"unstructured":"Hirahara, S., Oliveira, I.C., Santhanam, R.: NP-hardness of minimum circuit size problem for OR-AND-MOD circuits. In: 33rd Computational Complexity Conference, CCC 2018, San Diego, CA, USA, June 22\u201324, 2018, pp. 5:1\u20135:31 (2018)","key":"39_CR5"},{"unstructured":"Hirahara, S., Santhanam, R.: On the average-case complexity of MCSP and its variants. In: 32nd Computational Complexity Conference, CCC 2017, Riga, Latvia, July 6\u20139, 2017, pp. 7:1\u20137:20 (2017)","key":"39_CR6"},{"unstructured":"Hirahara, S., Watanabe, O.: Limits of minimum circuit size problem as oracle. In: 31st Conference on Computational Complexity, CCC 2016, Tokyo, Japan, May 29\u2013June 1, 2016, pp. 18:1\u201318:20 (2016)","key":"39_CR7"},{"unstructured":"Hitchcock, J.M., Pavan, A.: On the NP-completeness of the minimum circuit size problem. In: 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2015, Bangalore, India, December 16\u201318, 2015, pp. 236\u2013245 (2015)","key":"39_CR8"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-662-61649-9_8","volume-title":"Algebra","author":"S Bosch","year":"2020","unstructured":"Bosch, S.: Transzendente erweiterungen. Algebra, pp. 377\u2013429. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-662-61649-9_8"},{"unstructured":"McKay, D.M., Murray, C.D., Williams, R.R.: Weak lower bounds on resource-bounded compression imply strong separations of complexity classes. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23\u201326, 2019, pp. 1215\u20131225 (2019)","key":"39_CR10"},{"issue":"1","key":"39_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2017.v013a004","volume":"13","author":"CD Murray","year":"2017","unstructured":"Murray, C.D., Williams, R.R.: On the (non) np-hardness of computing circuit complexity. Theor. Comput. 13(1), 1\u201322 (2017)","journal-title":"Theor. Comput."},{"unstructured":"Oliveira, I.C., Pich, J., Santhanam, R.: Hardness magnification near state-of-the-art lower bounds. In: 34th Computational Complexity Conference, CCC 2019, New Brunswick, NJ, USA, July 18\u201320, 2019, pp. 27:1\u201327:29 (2019)","key":"39_CR12"},{"unstructured":"Oliveira, I.C., Santhanam, R.: Hardness magnification for natural problems. In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7\u20139, 2018, pp. 65\u201376 (2018)","key":"39_CR13"},{"key":"39_CR14","first-page":"14","volume":"27","author":"U Sch\u00f6ning","year":"1983","unstructured":"Sch\u00f6ning, U.: A low and a high hierarchy within NP. JCSS 27, 14\u201328 (1983)","journal-title":"JCSS"},{"doi-asserted-by":"crossref","unstructured":"Shoup, V.: New algorithms for finding irreducible polynomials over finite fields. In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, October 24\u201326, 1988, pp. 283\u2013290 (1988)","key":"39_CR15","DOI":"10.1109\/SFCS.1988.21944"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:42:14Z","timestamp":1619242934000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_39","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":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","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":"126","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":"54","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":"43% - 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":"2.7","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":"10.2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}