{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:49:50Z","timestamp":1742946590655,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"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_46","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"566-577","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Mystery of Negations in Circuits: Structure vs Power"],"prefix":"10.1007","author":[{"given":"Prashanth","family":"Amireddy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sai","family":"Jayasurya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayalal","family":"Sarma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"issue":"1","key":"46_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579196","volume":"7","author":"N Alon","year":"1987","unstructured":"Alon, N., Boppana, R.B.: The monotone circuit complexity of Boolean functions. Combinatorica 7(1), 1\u201322 (1987)","journal-title":"Combinatorica"},{"issue":"1","key":"46_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1137\/S0097539701396959","volume":"35","author":"K Amano","year":"2005","unstructured":"Amano, K., Maruoka, A.: A superpolynomial lower bound for a circuit computing the clique function with at most (1\/6)log log n negation gates. SIAM J. Comput. 35(1), 201\u2013216 (2005)","journal-title":"SIAM J. Comput."},{"key":"46_CR3","first-page":"123","volume":"8","author":"EI Nechiporuk","year":"1962","unstructured":"Nechiporuk, E.I.: On the complexity of schemes in some bases containing non-trivial elements with zero weights. Problemy Kibernetiki 8, 123\u2013160 (1962)","journal-title":"Problemy Kibernetiki"},{"key":"46_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-07407-4_9","volume-title":"Automata Theory and Formal Languages","author":"MJ Fischer","year":"1975","unstructured":"Fischer, M.J.: The complexity of negation-limited networks\u2014a brief survey. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 71\u201382. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/3-540-07407-4_9"},{"issue":"2","key":"46_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ipl.2003.10.003","volume":"89","author":"S Jukna","year":"2004","unstructured":"Jukna, S.: On the minimum number of negations leading to super-polynomial savings. Inf. Process. Lett. 89(2), 71\u201374 (2004)","journal-title":"Inf. Process. Lett."},{"key":"46_CR6","series-title":"Advances and Frontiers","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24508-4","volume-title":"Boolean Function Complexity","author":"S Jukna","year":"2012","unstructured":"Jukna, S.: Boolean Function Complexity. Advances and Frontiers. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-24508-4"},{"key":"46_CR7","unstructured":"Jukna, S., Lingas, A.: Lower bounds for demorgan circuits of bounded negation width. In: STACS (2019)"},{"issue":"2","key":"46_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1137\/0403021","volume":"3","author":"M Karchmer","year":"1990","unstructured":"Karchmer, M., Wigderson, A.: Monotone circuits for connectivity require super-logarithmic depth. SIAM J. Discret. Math. 3(2), 255\u2013265 (1990)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"46_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.3233\/FI-2017-1515","volume":"152","author":"S Koroth","year":"2017","unstructured":"Koroth, S., Sarma, J.: Depth lower bounds against circuits with sparse orientation. Fundam. Inf. 152(2), 123\u2013144 (2017)","journal-title":"Fundam. Inf."},{"issue":"4","key":"46_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1145\/320941.320945","volume":"5","author":"AA Markov","year":"1958","unstructured":"Markov, A.A.: On the inversion complexity of a system of functions. J. ACM 5(4), 331\u2013334 (1958)","journal-title":"J. ACM"},{"key":"46_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-642-02927-1_58","volume-title":"Automata, Languages and Programming","author":"H Morizumi","year":"2009","unstructured":"Morizumi, H.: Limiting negations in formulas. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 701\u2013712. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_58"},{"issue":"3","key":"46_CR12","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":"46_CR13","first-page":"354","volume":"31","author":"AA Razborov","year":"1985","unstructured":"Razborov, A.A.: Lower bounds for monotone complexity of some Boolean functions. Sov. Math. Doklady. 31, 354\u2013357 (1985)","journal-title":"Sov. Math. Doklady."},{"key":"46_CR14","unstructured":"Rossman, B.: Correlation bounds against monotone NC$$^1$$. In: Zuckerman, D. (ed.) 30th Conference on Computational Complexity, CCC 2015. LIPICS, vol. 33, pp. 392\u2013411 (2015)"},{"issue":"2","key":"46_CR15","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1137\/0222022","volume":"22","author":"M Santha","year":"1993","unstructured":"Santha, M., Wilson, C.: Limiting negations in constant depth circuits. SIAM J. Comput. 22(2), 294\u2013302 (1993)","journal-title":"SIAM J. Comput."},{"key":"46_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0304-3975(85)90209-9","volume":"38","author":"I Wegener","year":"1985","unstructured":"Wegener, I.: On the complexity of slice functions. Theor. Comput. Sci. 38, 55\u201368 (1985)","journal-title":"Theor. Comput. Sci."}],"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_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T19:46:56Z","timestamp":1619207216000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_46","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)"}}]}}