{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:22:23Z","timestamp":1742980943055,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"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_23","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"287-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Power of Decision Trees with Monotone Queries"],"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":[{"key":"23_CR1","unstructured":"Ben-Asher, Y., Newman, I.: Decision trees with and or queries. In Proceedings of 10th Annual Conference on Structure in Complexity Theory, pp. 74\u201381 (1995)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proceedings of the 15th ACM Symposium on Theory of Computing, pp. 80\u201386 (1983)","DOI":"10.1145\/800061.808735"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rner, A., Lov\u00e1sz, L., Yao, A.C.C.: Linear decision trees: volume estimates and topological bounds. In Proceedings of the 24th ACM Symposium on Theory of Computing, pp. 170\u2013177 (1992)","DOI":"10.1145\/129712.129730"},{"key":"23_CR4","first-page":"512","volume":"40","author":"E Blais","year":"2015","unstructured":"Blais, E., Canonne, C.L., Oliveira, I.C., Servedio, R.A., Tan, L.-Y.: Learning circuits with few negations. Approx. Random. Comb. Opti. 40, 512\u2013527 (2015)","journal-title":"Approx. Random. Comb. Opti."},{"issue":"4","key":"23_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(92)90237-P","volume":"42","author":"A Blum","year":"1992","unstructured":"Blum, A.: Rank-r decision trees are a subclass of r-decision lists. Inf. Process. Lett. 42(4), 183\u2013185 (1992)","journal-title":"Inf. Process. Lett."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0020-0190(96)00077-4","volume":"59","author":"NH Bshouty","year":"1996","unstructured":"Bshouty, N.H.: A subexponential exact learning algorithm for DNF using equivalence queries. Inf. Process. Lett. 59, 37\u201339 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(01)00144-X","volume":"288","author":"H Buhrman","year":"2002","unstructured":"Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci. 288(1), 21\u201343 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/0022-0000(78)90026-0","volume":"16","author":"D Dobkin","year":"1978","unstructured":"Dobkin, D., Lipton, R.J.: A lower bound of n on linear search programs for the knapsack problem. J. Comput. Syst. Sci. 16, 413\u2013417 (1978)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"23_CR9","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1137\/100785429","volume":"40","author":"P Gopalan","year":"2011","unstructured":"Gopalan, P., O\u2019Donnell, R., Servedio, R.A., Shpilka, A., Wimmer, K.: Testing Fourier dimensionality and sparsity. SIAM J. Comput. 40(4), 1075\u20131100 (2011)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/S0304-3975(00)00043-8","volume":"259","author":"D Guijarro","year":"2001","unstructured":"Guijarro, D., Lavin, V., Raghavan, V.: Monotone term decision lists. Theoret. Comput. Sci. 259(1), 549\u2013575 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR11","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. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-24508-4"},{"issue":"6","key":"23_CR12","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1137\/0222080","volume":"22","author":"E Kushilevitz","year":"1993","unstructured":"Kushilevitz, E., Mansour, Y.: Learning decision trees using the Fourier spectrum. SIAM J. Comput. 22(6), 1331\u20131348 (1993)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"23_CR13","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"},{"issue":"2","key":"23_CR14","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."},{"issue":"11","key":"23_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2019.v015a011","volume":"15","author":"S Sanyal","year":"2019","unstructured":"Sanyal, S.: Fourier sparsity and dimension. Theory Comput. 15(11), 1\u201313 (2019)","journal-title":"Theory Comput."},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/3-540-10843-2_25","volume-title":"Automata, Languages and Programming","author":"M Snir","year":"1981","unstructured":"Snir, M.: Proving lower bounds for linear decision trees. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 305\u2013315. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/3-540-10843-2_25"},{"key":"23_CR17","unstructured":"Steele, J.M., Yao, A.C.: Lower bounds for algebraic decision trees. Technical report, Department of Computer Science, Stanford University (1980)"},{"issue":"2","key":"23_CR18","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1137\/0209028","volume":"9","author":"AC Yao","year":"1980","unstructured":"Yao, A.C., Rivest, R.L.: On the polyhedral decision problem. SIAM J. Comput. 9(2), 343\u2013347 (1980)","journal-title":"SIAM J. Comput."},{"issue":"26","key":"23_CR19","doi-asserted-by":"publisher","first-page":"2612","DOI":"10.1016\/j.tcs.2010.03.027","volume":"411","author":"Z Zhang","year":"2010","unstructured":"Zhang, Z., Shi, Y.: On the parity complexity measures of Boolean functions. Theoret. Comput. Sci. 411(26), 2612\u20132618 (2010)","journal-title":"Theoret. 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_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T19:42:03Z","timestamp":1619206923000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_23","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)"}}]}}