{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:22:54Z","timestamp":1771485774190,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030406073","type":"print"},{"value":"9783030406080","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-40608-0_16","type":"book-chapter","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T00:07:34Z","timestamp":1582589254000},"page":"235-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 Function"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2322-6072","authenticated-orcid":false,"given":"Kazuyuki","family":"Amano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,25]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/11549345_11","volume-title":"Mathematical Foundations of Computer Science 2005","author":"K Amano","year":"2005","unstructured":"Amano, K., Maruoka, A.: On the complexity of depth-2 circuits with threshold gates. In: J\u0229drzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 107\u2013118. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11549345_11"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"104439","DOI":"10.1016\/j.ic.2019.104439","volume":"269","author":"K Amano","year":"2019","unstructured":"Amano, K., Tate, S.: On XOR lemmas for the weight of polynomial threshold functions. Inf. Comput. 269, 104439 (2019)","journal-title":"Inf. Comput."},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00037-008-0244-2","volume":"17","author":"S Basu","year":"2008","unstructured":"Basu, S., Bhatnagar, N., Gopalan, P., Lipton, R.: Polynomials that sign represent parity and descartes\u2019 rule of signs. Comput. Complex. 17(3), 377\u2013406 (2008). (Conference version in CCC \u201904)","journal-title":"Comput. Complex."},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/0403015","volume":"3","author":"J Bruck","year":"1990","unstructured":"Bruck, J.: Harmonic analysis of polynomial threshold functions. SIAM J. Discrete Math. 3(2), 168\u2013177 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, A., Mande, N.: A short list of equalities induces large sign rank. In: Proceedings of FOCS 2018, pp. 47\u201358 (2018)","DOI":"10.1109\/FOCS.2018.00014"},{"key":"16_CR6","unstructured":"Eldan, R., Shamir, O.: The power of depth for feedforward neural networks. In: Proceedings of COLT 2016, pp. 907\u2013940 (2016)"},{"issue":"4","key":"16_CR7","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/S0022-0000(02)00019-3","volume":"65","author":"J Forster","year":"2002","unstructured":"Forster, J.: A linear lower bound on the unbounded error probabilistic communication complexity. J. Comput. Syst. Sci. 65(4), 612\u2013625 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-45294-X_15","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"J Forster","year":"2001","unstructured":"Forster, J., Krause, M., Lokam, S.V., Mubarakzjanov, R., Schmitt, N., Simon, H.U.: Relations between communication complexity, linear arrangements, and computational complexity. In: Hariharan, R., Vinay, V., Mukund, M. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 171\u2013182. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45294-X_15"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF01200426","volume":"2","author":"M Goldmann","year":"1992","unstructured":"Goldmann, M., H\u00e5stad, J., Razborov, A.: Majority gates vs. general weighted threshold gates. Comput. Complex. 2, 277\u2013300 (1992)","journal-title":"Comput. Complex."},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0022-0000(93)90001-D","volume":"46","author":"A Hajnal","year":"1993","unstructured":"Hajnal, A., Maass, W., Pudl\u00e1k, P., Szegedy, M., Tur\u00e1n, G.: Threshold circuits of bounded depth. J. Comput. Syst. Sci. 46(2), 129\u2013154 (1993)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Hansen, K., Podolskii, V.: Exact threshold circuits. In: Proceedings of CCC 2010, pp. 270\u2013279 (2010)","DOI":"10.1109\/CCC.2010.33"},{"key":"16_CR12","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24508-4","volume-title":"Boolean Function Complexity, Advances and Frontiers","author":"S Jukna","year":"2012","unstructured":"Jukna, S.: Boolean Function Complexity, Advances and Frontiers. Algorithms and Combinatorics, vol. 27. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-24508-4"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Kane, D., Williams, R.: Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits. In: Proceedings of STOC 2016, pp. 633\u2013643 (2016)","DOI":"10.1145\/2897518.2897636"},{"issue":"1\u20132","key":"16_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0304-3975(96)00019-9","volume":"174","author":"M Krause","year":"1997","unstructured":"Krause, M., Pudl\u00e1k, P.: On the computational power of depth-2 circuits with threshold and modulo gates. Theor. Comput. Sci. 174(1\u20132), 137\u2013156 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR15","volume-title":"Threshold Logic and Its Applications","author":"S Muroga","year":"1971","unstructured":"Muroga, S.: Threshold Logic and Its Applications. Wiley, Hoboken (1971)"},{"key":"16_CR16","unstructured":"Nisan, N.: The communication complexity of threshold gates. In: Proceedings of \u201cCombinatorics, Paul Erd\u0151s is Eighty\", pp. 301\u2013315 (1994)"},{"issue":"2","key":"16_CR17","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1109\/18.312169","volume":"40","author":"V Roychowdhury","year":"1994","unstructured":"Roychowdhury, V., Orlitsky, A., Siu, K.Y.: Lower bounds on threshold and related circuits via communication complexity. IEEE Trans. Inf. Theory 40(2), 467\u2013474 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR18","unstructured":"Safran, I., Eldan, R., Shamir, O.: Depth separations in neural networks: what is actually being separated?. In: Proceedings of COLT 2019, pp. 2664\u20132666 (2019). (full version at Arxiv:1904.06984)"},{"issue":"8","key":"16_CR19","doi-asserted-by":"publisher","first-page":"1796","DOI":"10.1162\/NECO_a_00750","volume":"27","author":"C Sezener","year":"2015","unstructured":"Sezener, C., Oztop, E.: Minimal sign representation of boolean functions: algorithms and exact results for low dimensions. Neural Comput. 27(8), 1796\u20131823 (2015)","journal-title":"Neural Comput."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-40608-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T20:42:15Z","timestamp":1741466535000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-40608-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030406073","9783030406080"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40608-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"4 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2020","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":"lata2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lata2020.irdta.eu\/","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":"59","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":"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":"4","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":"In addition, there are 6 invited papers. Due to the coronavirus pandemic the actual conference was postponed to be held together with LATA 2021.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}