{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:42:41Z","timestamp":1730274161872,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006528","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"251-255","source":"Crossref","is-referenced-by-count":2,"title":["Enumeration of Boolean functions of sensitivity three and inheritance of nondegeneracy"],"prefix":"10.1109","author":[{"given":"Kazuyuki","family":"Amano","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2002.12.001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282505"},{"journal-title":"Sensitivity conecjture and log-rank conjecture for functions with small alternating numbers","year":"2016","author":"lin","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01263419"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01192527"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200762"},{"journal-title":"The On-Line Encyclopedia of Integer Sequences","year":"0","author":"sloane","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)90477-6"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422485"},{"key":"ref19","first-page":"38:1","article-title":"On the sensitivity conjecture","author":"tal","year":"2016","journal-title":"Proceedings 16 ICALP"},{"key":"ref4","first-page":"16:1","article-title":"On the sensitivity conjectur for read-k formulas","author":"bafna","year":"2016","journal-title":"Proc of MFCS '16"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-34171-2_2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90083-6"},{"key":"ref5","article-title":"Low-sensitivity functions from unambiguous certificates","volume":"23","author":"ben-david","year":"2017","journal-title":"Proc ITC 17"},{"key":"ref8","first-page":"1","article-title":"Variations on the sensitivity conjecture","volume":"4","author":"hatami","year":"2011","journal-title":"Theory of Computing Library Graduate Surveys"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840738"},{"key":"ref2","article-title":"New separation between $s(f)$ and $bs(f)$","author":"ambainis","year":"2011","journal-title":"ECCC TR11-116"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897644"},{"journal-title":"A tighter relation between sensitivity and certificate complexity","year":"2016","author":"he","key":"ref9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.02.001"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80036-X"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006528.pdf?arnumber=8006528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T15:49:13Z","timestamp":1513180153000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006528\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006528","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}