{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:12:34Z","timestamp":1743059554263,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319905297"},{"type":"electronic","value":"9783319905303"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-319-90530-3_18","type":"book-chapter","created":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T07:23:53Z","timestamp":1524554633000},"page":"207-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quadratically Tight Relations for Randomized Query Complexity"],"prefix":"10.1007","author":[{"given":"Rahul","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hartmut","family":"Klauck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srijita","family":"Kundu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Troy","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miklos","family":"Santha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swagato","family":"Sanyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jevg\u0113nijs","family":"Vihrovs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,25]]},"reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.jcss.2007.06.020","volume":"74","author":"S Aaronson","year":"2008","unstructured":"Aaronson, S.: Quantum certificate complexity. J. Comput. Syst. Sci. 74(3), 313\u2013322 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Ben-David, S., Kothari, R.: Separations in query complexity using cheat sheets. In: Proceedings of the Forty-eighth Annual ACM Symposium on Theory of Computing, STOC 2016, pp. 863\u2013876. ACM, New York (2016)","DOI":"10.1145\/2897518.2897644"},{"key":"18_CR3","unstructured":"Ambainis, A., Kokainis, M., Kothari, R.: Nearly optimal separations between communication (or query) complexity and partitions. In: Proceedings of the 31st Conference on Computational Complexity, CCC 2016, pp. 4:1\u20134:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Germany (2016)"},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1145\/502090.502097","volume":"48","author":"R Beals","year":"2001","unstructured":"Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. J. ACM 48(4), 778\u2013797 (2001)","journal-title":"J. ACM"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Blum, M., Impagliazzo, R.: Generic oracles and oracle classes. In: Proceedings of the 28th Annual Symposium on Foundations of Computer Science, SFCS 1987, pp. 118\u2013126. IEEE Computer Society, Washington (1987)","DOI":"10.1109\/SFCS.1987.30"},{"issue":"1","key":"18_CR6","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":"18_CR7","unstructured":"Gavinsky, D., Jain, R., Klauck, H., Kundu, S., Lee, T., Santha, M., Sanyal, S., Vihrovs, J.: Quadratically tight relations for randomized query complexity. CoRR, abs\/1708.00822 (2017)"},{"issue":"3","key":"18_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s00493-014-3189-x","volume":"36","author":"J Gilmer","year":"2016","unstructured":"Gilmer, J., Saks, M., Srinivasan, S.: Composition limits and separating examples for some Boolean function complexity measures. Combinatorica 36(3), 265\u2013311 (2016)","journal-title":"Combinatorica"},{"key":"18_CR9","unstructured":"Harsha, P., Jain, R., Radhakrishnan, J.: Relaxed partition bound is quadratically tight for product distributions. CoRR, abs\/1512.01968 (2015)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Hartmanis, J., Hemachandra, L.A.: One-way functions, robustness, and non-isomorphism of NP-complete sets. In: Proceedings of 2nd Structure in Complexity Theory, pp. 160\u2013173 (1987)","DOI":"10.1109\/PSCT.1987.10319267"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Jain, R., Klauck, H.: The partition bound for classical communication complexity and query complexity. In: Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity, CCC 2010, pp. 247\u2013258. IEEE Computer Society, Washington (2010)","DOI":"10.1109\/CCC.2010.31"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/cjtcs.2016.008","volume":"8","author":"R Kulkarni","year":"2016","unstructured":"Kulkarni, R., Tal, A.: On fractional block sensitivity. Chicago J. Theor. Comput. Sci. 8, 1\u201316 (2016)","journal-title":"Chicago J. Theor. Comput. Sci."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Nisan, N.: CREW PRAMS and decision trees. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC 1989, pp. 327\u2013335. ACM, New York (1989)","DOI":"10.1145\/73007.73038"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Tal, A.: Properties and applications of boolean function composition. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, ITCS 2013, pp. 441\u2013454. ACM, New York (2013)","DOI":"10.1145\/2422436.2422485"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02125350","volume":"9","author":"G Tardos","year":"1990","unstructured":"Tardos, G.: Query complexity or why is it difficult to separate $$\\mathbf{NP}^A \\cap \\mathbf{coNP}^A$$ from $$\\mathbf{P}^A$$ by a random oracle. Combinatorica 9, 385\u2013392 (1990)","journal-title":"Combinatorica"}],"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-319-90530-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:30:36Z","timestamp":1710243036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-90530-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319905297","9783319905303"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90530-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"25 April 2018","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":"Moscow","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}