{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:55:24Z","timestamp":1743022524945,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031231001"},{"type":"electronic","value":"9783031231018"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-23101-8_20","type":"book-chapter","created":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T20:18:53Z","timestamp":1671481133000},"page":"301-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bounds for\u00a0Monotone q-Multilinear Boolean Circuits"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4998-9844","authenticated-orcid":false,"given":"Andrzej","family":"Lingas","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579196","volume":"7","author":"N Alon","year":"1987","unstructured":"Alon, N., Boppana, R.: The monotone circuit complexity of Boolean functions. Combinatorica 7(1), 1\u201322 (1987)","journal-title":"Combinatorica"},{"key":"20_CR2","unstructured":"Grinchuk, M.I., Sergeev, I.S.: Thin circulant matrices and lower bounds on the complexity of some Boolean operations. Diskretn. Anal. Issled. Oper. 18, pp. 35\u201353, (2011). (See also CORR.abs\/1701.08557 2017"},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1145\/322326.322341","volume":"29","author":"M Jerrum","year":"1982","unstructured":"Jerrum, M., Snir, M.: Some exact complexity results for straight-line computations over semirings. J. ACM 29(3), 874\u2013897 (1982)","journal-title":"J. ACM"},{"key":"20_CR4","unstructured":"Jukna, S.: Personnal communication, June (2022)"},{"key":"20_CR5","unstructured":"Jukna, S.: Notes on Boolean Read-k Circuits. Electron. Colloquium Comput. Complex. TR22-094 (2022)"},{"issue":"2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s00224-007-2013-z","volume":"41","author":"MP Krieger","year":"2007","unstructured":"Krieger, M.P.: On the incompressibility of monotone DNFs. Theor. Comput. Syst. 41(2), 211\u2013231 (2007)","journal-title":"Theor. Comput. Syst."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Lingas, A.: A Note on Lower Bounds for Monotone Multilinear Boolean Circuits. Electron. Colloquium Comput. Complex. TR22-085 (2022)","DOI":"10.2139\/ssrn.4572070"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Lingas, A.: Small normalized Boolean circuits for semi-disjoint bilinear forms require logarithmic conjunction-depth. Theoretical Computer Science 820, pp. 17\u201325 (2020) (prel. version Computational Complexity Conference (CCC) 2018)","DOI":"10.1016\/j.tcs.2020.03.005"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF02241983","volume":"16","author":"K Mehlhorn","year":"1976","unstructured":"Mehlhorn, K., Galil, Z.: Monotone switching circuits and Boolean matrix product. Computing 16, 99\u2013111 (1976)","journal-title":"Computing"},{"key":"20_CR10","unstructured":"Nes\u0306etr\u0306il, J., Poljak, S.: On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae 26(2), 415\u2013419 (1985)"},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0304-3975(75)90009-2","volume":"1","author":"M Paterson","year":"1975","unstructured":"Paterson, M.: Complexity of monotone networks for Boolean matrix product. Theor. Comput. Sci. 1(1), 13\u201320 (1975)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Ponnuswami, A.K., Venkateswaran, H.: Monotone multilinear Boolean circuits for bipartite perfect matching require exponential size. In Proceedings of 24th International Conference on Foundations of Software Technology and Theoretical Computer Science (FST-TCS), pp. 16\u201318 (2004)","DOI":"10.1007\/978-3-540-30538-5_38"},{"issue":"3","key":"20_CR13","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1137\/0204027","volume":"4","author":"R Pratt","year":"1975","unstructured":"Pratt, R.: The power of negative thinking in multiplying Boolean matrices. SIAM J. Comput. 4(3), 326\u2013330 (1975)","journal-title":"SIAM J. Comput."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Raz, R.: Multi-linear formulas for permanent and determinant are of super-polynomial size. Electron. Colloquium Comput. Complex. (067) (2003)","DOI":"10.1145\/1007352.1007353"},{"issue":"3","key":"20_CR15","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1145\/146637.146684","volume":"39","author":"R Raz","year":"1992","unstructured":"Raz, R., Wigderson, A.: Monotone circuits for matching require linear depth. J. ACM 39(3), 736\u2013744 (1992)","journal-title":"J. ACM"},{"key":"20_CR16","first-page":"354","volume":"31","author":"AA Razborov","year":"1985","unstructured":"Razborov, A.A.: Lower bounds for the monotone complexity of some Boolean functions. Soviet Math. Dokl. 31, 354\u2013357 (1985)","journal-title":"Soviet Math. Dokl."},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Razborov, A.A.: Lower bounds on monotone complexity of the logical permanent. Math. Notes of the Acad. of Sci. of the USSR, 37(6), pp. 485\u2013493 (1985)","DOI":"10.1007\/BF01157687"},{"issue":"3","key":"20_CR18","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0304-3975(76)90083-9","volume":"2","author":"CP Schnorr","year":"1976","unstructured":"Schnorr, C.P.: A lower bound on the number of additions in monotone computations. Theor. Comput. Sci. 2(3), 305\u2013315 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR19","unstructured":"Sengupta, R., Venkateswaran, H.: Multilinearity can be exponentially restrictive (pre-liminary version). Technical Report GIT-CC-94-40, Georgia Institute of Technology. College of Computing (1994)"},{"key":"20_CR20","unstructured":"Shamir, E., Snir, M.: Lower bounds on the number of multiplications and the number of additions in monotone computations. Tech. Rep. RC 6757, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, (1977)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2023: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23101-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,3]],"date-time":"2023-12-03T08:11:11Z","timestamp":1701591071000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23101-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031231001","9783031231018"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23101-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ics.science.upjs.sk\/sofsem2023\/","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":"43","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":"26","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":"60% - 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":"6-7","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)"}}]}}