{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:26:35Z","timestamp":1725823595131},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476710"},{"type":"electronic","value":"9783662476727"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_84","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:39Z","timestamp":1434708459000},"page":"1035-1045","source":"Crossref","is-referenced-by-count":1,"title":["Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity"],"prefix":"10.1007","author":[{"given":"Swagato","family":"Sanyal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"84_CR1","unstructured":"Gavinsky, D., Kirshner, N., de Wolf, R., Samorodnitsky, A.: Private Communication"},{"key":"84_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1007\/978-3-642-02927-1_42","volume-title":"Automata, Languages and Programming","author":"P Gopalan","year":"2009","unstructured":"Gopalan, P., O\u2019Donnell, R., Servedio, R.A., Shpilka, A., Wimmer, K.: Testing fourier dimensionality and sparsity. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 500\u2013512. Springer, Heidelberg (2009)"},{"key":"84_CR3","doi-asserted-by":"crossref","unstructured":"Lovett,S.: Communication is bounded by root of rank. In: Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 \u2013 June 03, 2014, pp. 842\u2013846 (2014)","DOI":"10.1145\/2591796.2591799"},{"key":"84_CR4","unstructured":"O\u2019Donnell, R.: Analysis of Boolean Functions. Cambridge University Press (2014). \n                    http:\/\/www.cambridge.org\/de\/academic\/subjects\/computer-science\/algorithmics-complexity-computer-algebra-and-computational-g\/analysis-boolean-functions"},{"key":"84_CR5","unstructured":"Shpilka, A., Tal, A., lee Volk, B..: On the structure of boolean functions with small spectral norm. In: Innovations in Theoretical Computer Science, ITCS 2014, Princeton, NJ, USA, January 12\u201314, pp. 37\u201348 (2014). \n                    arxiv.org\/abs\/1304.0371"},{"key":"84_CR6","doi-asserted-by":"crossref","unstructured":"Tsang, H.Y., Wong, C.H., Xie, N., Zhang, S.: Fourier sparsity, spectral norm, and the log-rank conjecture. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26\u201329 October, 2013, Berkeley, CA, USA, pp. 658\u2013667 (2013)","DOI":"10.1109\/FOCS.2013.76"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_84","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T21:43:42Z","timestamp":1547847822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_84","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}