{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:12:10Z","timestamp":1753272730518,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030794156"},{"type":"electronic","value":"9783030794163"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79416-3_18","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T18:03:46Z","timestamp":1623866626000},"page":"296-320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata"],"prefix":"10.1007","author":[{"given":"Augusto","family":"Modanese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/1706591.1706594","volume":"57","author":"E Allender","year":"2010","unstructured":"Allender, E., Kouck\u00fd, M.: Amplifying lower bounds by means of self-reducibility. J. ACM 57(3), 14:1-14:36 (2010)","journal-title":"J. ACM"},{"key":"18_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)"},{"issue":"4","key":"18_CR3","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0204037","volume":"4","author":"TP Baker","year":"1975","unstructured":"Baker, T.P., Gill, J., Solovay, R.: Relativizations of the P =? NP question. SIAM J. Comput. 4(4), 431\u2013442 (1975)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1145\/3828.3834","volume":"32","author":"B Chazelle","year":"1985","unstructured":"Chazelle, B., Monier, L.: A model of computation for VLSI with related complexity results. J. ACM 32(3), 573\u2013588 (1985)","journal-title":"J. ACM"},{"key":"18_CR5","unstructured":"Chen, L., Hirahara, S., Oliveira, I.C., Pich, J., Rajgopal, N., Santhanam, R.: Beyond natural proofs: hardness magnification and locality. In: Vidick, T. (ed.) 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, Seattle, Washington, USA, 12\u201314 January 2020. LIPIcs, vol. 151, pp. 70:1\u201370:48. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Chen, L., Jin, C., Williams, R.R.: Hardness magnification for all sparse NP languages. In: Zuckerman, D (ed.) 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, 9\u201312 November 2019, pp. 1240\u20131255. IEEE Computer Society (2019)","DOI":"10.1109\/FOCS.2019.00077"},{"key":"18_CR7","unstructured":"Cheraghchi, M., Hirahara, S., Myrisiotis, D., Yoshida, Y.: One-tape turing machine and branching program lower bounds for MCSP. In: Electronic Colloquium on Computational Complexity (ECCC), no. 103 (2020)"},{"key":"18_CR8","series-title":"Mathematics and Its Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9153-9","volume-title":"Cellular Automata: A Parallel Model","year":"1999","unstructured":"Delorme, M., Mazoyer, J. (eds.): Cellular Automata: A Parallel Model. Mathematics and Its Applications, vol. 460. Springer, Dordrecht (1999). https:\/\/doi.org\/10.1007\/978-94-015-9153-9"},{"issue":"2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.tcs.2004.03.017","volume":"322","author":"C D\u00fcrr","year":"2004","unstructured":"D\u00fcrr, C., Rapaport, I., Theyssier, G.: Cellular automata and communication complexity. Theor. Comput. Sci. 322(2), 355\u2013368 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804106","volume-title":"Computational Complexity: A Conceptional Perspective","author":"O Goldreich","year":"2008","unstructured":"Goldreich, O.: Computational Complexity: A Conceptional Perspective. Cambridge University Press, Cambridge (2008)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(85)90073-8","volume":"41","author":"OH Ibarra","year":"1985","unstructured":"Ibarra, O.H., Palis, M.A., Kim, S.M.: Fast parallel language recognition by cellular automata. Theor. Comput. Sci. 41, 231\u2013246 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR12","unstructured":"Ilango, R., Loff, B., Oliveira, I.C.: NP-hardness of circuit minimization for multi-output functions. In: Saraf, S. (ed.) 35th Computational Complexity Conference, CCC 2020, Saarbr\u00fccken, Germany, 28\u201331 July 2020 (Virtual Conference). LIPIcs, vol. 169, pp. 22:1\u201322:36. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Kabanets, V., Cai, J.Y.: Circuit minimization problem. In: Yao, F.F., Luks, E.M. (eds.) Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, Portland, OR, USA, 21\u201323 May 2000, pp. 73\u201379. ACM (2000)","DOI":"10.1145\/335305.335314"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(85)90165-3","volume":"40","author":"K Kobayashi","year":"1985","unstructured":"Kobayashi, K.: On the structure of one-tape nondeterministic turing machine time hierarchy. Theor. Comput. Sci. 40, 175\u2013193 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-18812-6_1","volume-title":"Cellular Automata and Discrete Complex Systems","author":"M Kutrib","year":"2015","unstructured":"Kutrib, M.: Complexity of one-way cellular automata. In: Isokawa, T., Imai, K., Matsui, N., Peper, F., Umeo, H. (eds.) AUTOMATA 2014. LNCS, vol. 8996, pp. 3\u201318. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18812-6_1"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Shrinking one-way cellular automata. Nat. Comput.16(3), pp. 383\u2013396 (2017)","DOI":"10.1007\/s11047-016-9588-8"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"McKay, D.M., Murray, C.D., Williams, R.R.: Weak lower bounds on resource-bounded compression imply strong separations of complexity classes. In: Charikar, M., Cohen, E. (eds.) Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, 23\u201326 June 2019, pp. 1215\u20131225 (2019)","DOI":"10.1145\/3313276.3316396"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-030-20981-0_2","volume-title":"Cellular Automata and Discrete Complex Systems","author":"A Modanese","year":"2019","unstructured":"Modanese, A.: Complexity-theoretic aspects of expanding cellular automata. In: Castillo-Ramirez, A., de Oliveira, P.P.B. (eds.) AUTOMATA 2019. LNCS, vol. 11525, pp. 20\u201334. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20981-0_2"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-48516-0_19","volume-title":"Developments in Language Theory","author":"A Modanese","year":"2020","unstructured":"Modanese, A.: Sublinear-time language recognition and decision by one-dimensional cellular automata. In: Jonoska, N., Savchuk, D. (eds.) DLT 2020. LNCS, vol. 12086, pp. 251\u2013265. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-48516-0_19"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Modanese, A., Worsch, T.: Shrinking and expanding cellular automata. In: Cook, M., Neary, T. (eds.) Proceedings of Cellular Automata and Discrete Complex Systems -22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, Zurich, Switzerland, June 15\u201317, LNCS, vol. 9664, pp. 159\u2013169. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-39300-1_13"},{"issue":"1","key":"18_CR21","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. Theory Comput. 13(1), 1\u201322 (2017)","journal-title":"Theory Comput."},{"key":"18_CR22","unstructured":"Oliveira, I.C., Pich, J., Santhanam, R.: Hardness magnification near state-of-the-art lower bounds. In: Shpilka, A. (ed.) 34th Computational Complexity Conference, CCC 2019, New Brunswick, NJ, USA, 18\u201320 July 2019. LIPIcs, vol. 137, pp. 27:1\u201327:29. Schloss Dagstuhl - Leibniz- Zentrum f\u00fcr Informatik (2019)"},{"key":"18_CR23","unstructured":"Oliveira, I.C., Santhanam, R.: Hardness magnification for natural problems. In: Thorup, M. (ed.) 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7\u20139 October 2018, IEEE Computer Society, pp. 65\u201376 (2018)"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Poupet, V.: A padding technique on cellular automata to transfer inclusions of complexity classes. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds.) Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3\u20137, LNCS, vol. 4649, pp. 337\u2013348. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-74510-5_34"},{"issue":"1","key":"18_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0020-0255(83)90045-2","volume":"30","author":"A Rosenfeld","year":"1983","unstructured":"Rosenfeld, A., Wu, A.Y., Dubitzki, T.: Fast language acceptance by shrinking cellular automata. Inf. Sci. 30(1), 47\u201353 (1983)","journal-title":"Inf. Sci."},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF00290736","volume":"19","author":"R Sommerhalder","year":"1983","unstructured":"Sommerhalder, R., van Westrhenen, S.C.: Parallel language recognition in constant time by cellular automata. Acta Informatica 19, 397\u2013407 (1983)","journal-title":"Acta Informatica"},{"issue":"7","key":"18_CR27","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1016\/S0167-739X(02)00073-0","volume":"18","author":"M Stratmann","year":"2002","unstructured":"Stratmann, M., Worsch, T.: Leader election in d-dimensional CA in time diam log(diam). Future Gener. Comput. Syst. 18(7), 939\u2013950 (2002)","journal-title":"Future Gener. Comput. Syst."},{"key":"18_CR28","unstructured":"Thompson, C.D.: A complexity theory for VLSI. Ph.D. thesis. Department of Computer Science, Carnegie-Mellon University, August 1980"},{"issue":"4","key":"18_CR29","first-page":"293","volume":"3","author":"R Vollmar","year":"1977","unstructured":"Vollmar, R.: On two modified problems of synchronization in cellular automata. Acta Cybern. 3(4), 293\u2013300 (1977)","journal-title":"Acta Cybern."},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Circuits and local computation. In: Johnson, D.S. (ed.) Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, Washington, USA, 14\u201317 May 1989, pp. 186\u2013196. ACM (1989)","DOI":"10.1145\/73007.73025"}],"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-79416-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T23:56:43Z","timestamp":1725235003000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79416-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030794156","9783030794163"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79416-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","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":"Sochi","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2021\/","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":"68","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":"28","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":"41% - 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.1","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":"9.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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}