{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:05Z","timestamp":1759638965393,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282505","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T18:09:52Z","timestamp":1443722992000},"page":"501-505","source":"Crossref","is-referenced-by-count":2,"title":["Restrictions of nondegenerate Boolean functions and degree lower bounds over different rings"],"prefix":"10.1109","author":[{"given":"Chia-Jung","family":"Lee","sequence":"first","affiliation":[]},{"given":"Satyanarayana V.","family":"Lokam","sequence":"additional","affiliation":[]},{"given":"Shi-Chun","family":"Tsai","sequence":"additional","affiliation":[]},{"given":"Ming-Chuan","family":"Yang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-010-0290-4"},{"key":"ref3","article-title":"Nonclassical polynomials as a barrier to polynomial lower bounds","author":"bhowmick","year":"2014","journal-title":"Electronic Colloquium on Computational Complexity (ECCC) TRI4-175"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1137\/S0895480193255505","article-title":"Lower bounds on representing Boolean functions as polynomials in Zm","volume":"9","author":"tasi","year":"1996","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-24508-4","author":"jukna","year":"2012","journal-title":"Boolean Function Complexity Advances and Frontiers"},{"article-title":"Computational limitations for small depth circuits","year":"1986","author":"h\u00e5stad","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01137685"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01263419"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.06.006"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.65"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2015,6,14]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282505.pdf?arnumber=7282505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T16:37:51Z","timestamp":1498235871000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282505\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282505","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}