{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T17:36:21Z","timestamp":1648920981449},"reference-count":17,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2016,8,1]],"date-time":"2016-08-01T00:00:00Z","timestamp":1470009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1016\/j.ipl.2016.03.012","type":"journal-article","created":{"date-parts":[[2016,4,9]],"date-time":"2016-04-09T20:06:25Z","timestamp":1460232385000},"page":"537-540","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Correlation lower bounds from correlation upper bounds"],"prefix":"10.1016","volume":"116","author":[{"given":"Shiteng","family":"Chen","sequence":"first","affiliation":[]},{"given":"Periklis A.","family":"Papakonstantinou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ipl.2016.03.012_br0010","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/s000370050030","article-title":"Lower bounds for modular counting by circuits with modular gates","volume":"8","author":"Mix Barrington","year":"1999","journal-title":"Comput. Complex."},{"issue":"9","key":"10.1016\/j.ipl.2016.03.012_br0020","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/j.crma.2005.03.008","article-title":"Estimation of certain exponential sums arising in complexity theory","volume":"340","author":"Bourgain","year":"2005","journal-title":"C. R. Math."},{"issue":"3","key":"10.1016\/j.ipl.2016.03.012_br0030","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF01201278","article-title":"On the correlation of symmetric functions","volume":"29","author":"Cai","year":"1996","journal-title":"Math. Syst. Theory"},{"issue":"1","key":"10.1016\/j.ipl.2016.03.012_br0040","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(96)00029-4","article-title":"A note on a theorem of Barrington, Straubing and Th\u00e9rien","volume":"58","author":"Caussinus","year":"1996","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ipl.2016.03.012_br0050","series-title":"Foundations of Computer Science","first-page":"449","article-title":"Discrepancy and the power of bottom fan-in in depth-three circuits","author":"Chattopadhyay","year":"2007"},{"key":"10.1016\/j.ipl.2016.03.012_br0060","series-title":"Foundations of Computer Science","first-page":"709","article-title":"Lower bounds for circuits with MODm gates","author":"Chattopadhyay","year":"2006"},{"key":"10.1016\/j.ipl.2016.03.012_br0070","series-title":"Conference on Computational Complexity","first-page":"300","article-title":"Linear systems over finite abelian groups","author":"Chattopadhyay","year":"2011"},{"key":"10.1016\/j.ipl.2016.03.012_br0080","series-title":"50th Annual IEEE Symposium on Foundations of Computer Science, 2009","first-page":"43","article-title":"Linear systems over composite moduli","author":"Chattopadhyay","year":"2009"},{"issue":"4","key":"10.1016\/j.ipl.2016.03.012_br0090","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s002240000126","article-title":"Exponential sums and circuits with a single threshold gate and mod-gates","volume":"32","author":"Green","year":"1999","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.ipl.2016.03.012_br0100","series-title":"Conference on Computational Complexity","first-page":"47","article-title":"The correlation between parity and quadratic polynomials mod 3","author":"Green","year":"2002"},{"issue":"5","key":"10.1016\/j.ipl.2016.03.012_br0110","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.crma.2005.07.011","article-title":"Bounds on an exponential sum arising in boolean circuit complexity","volume":"341","author":"Green","year":"2005","journal-title":"C. R. Math."},{"key":"10.1016\/j.ipl.2016.03.012_br0120","series-title":"Foundations of Computer Science","first-page":"279","article-title":"Lower bounds for (MOD p-MOD m) circuits","author":"Grolmusz","year":"1998"},{"key":"10.1016\/j.ipl.2016.03.012_br0130","series-title":"Foundations of Computer Science","first-page":"99","article-title":"Threshold circuits of bounded depth","author":"Hajnal","year":"1987"},{"key":"10.1016\/j.ipl.2016.03.012_br0140","first-page":"598","article-title":"Lower bounds on the size of bounded depth networks over a complete basis with logical addition","volume":"41","author":"Razborov","year":"1986","journal-title":"Mat. Zametki"},{"key":"10.1016\/j.ipl.2016.03.012_br0150","series-title":"Symposium on Theory of Computing","first-page":"77","article-title":"Algebraic methods in the theory of lower bounds for boolean circuit complexity","author":"Smolensky","year":"1987"},{"issue":"5","key":"10.1016\/j.ipl.2016.03.012_br0160","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/s00224-004-1210-2","article-title":"A note on MODp-MODm circuits","volume":"39","author":"Straubing","year":"2006","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.ipl.2016.03.012_br0170","series-title":"On the Power of Small-Depth Computation","author":"Viola","year":"2009"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019016300424?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019016300424?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T09:56:45Z","timestamp":1536832605000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019016300424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":17,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["S0020019016300424"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2016.03.012","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2016,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Correlation lower bounds from correlation upper bounds","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2016.03.012","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2016 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}