{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T00:21:40Z","timestamp":1782778900799,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,19]],"date-time":"2016-06-19T00:00:00Z","timestamp":1466294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,19]]},"DOI":"10.1145\/2897518.2897567","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T13:04:07Z","timestamp":1465563847000},"page":"1021-1032","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["A polynomial lower bound for testing monotonicity"],"prefix":"10.1145","author":[{"given":"Aleksandrs","family":"Belovs","sequence":"first","affiliation":[{"name":"CWI, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Blais","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,6,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2015.v011a016"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591887"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-012-0040-x"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1333875.1334214"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-012-2765-1"},{"key":"e_1_3_2_1_6_1","volume-title":"Open problem for february","author":"Canonne C.","year":"2015","unstructured":"C. Canonne . Open problem for february 2015 . Property Testing Review Blog post), 2015. C. Canonne. Open problem for february 2015. Property Testing Review Blog post), 2015."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488660"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2014.v010a017"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746570"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.38"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-012-0045-5"},{"key":"e_1_3_2_1_12_1","first-page":"108","volume-title":"Proc. of 3rd RANDOM","author":"Dodis Y.","unstructured":"Y. Dodis , O. Goldreich , E. Lehman , S. Raskhodnikova , D. Ron , and A. Samorodnitsky . Improved testing algorithms for monotonicity . In Proc. of 3rd RANDOM , pages 97\u2013 108 . Springer, 1999. Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron, and A. Samorodnitsky. Improved testing algorithms for monotonicity. In Proc. of 3rd RANDOM, pages 97\u2013108. Springer, 1999."},{"key":"e_1_3_2_1_13_1","first-page":"97","article-title":"The art of uninformed decisions: A primer to property testing","volume":"75","author":"Fischer E.","year":"2001","unstructured":"E. Fischer . The art of uninformed decisions: A primer to property testing . Bulletin of EATCS , 75 : 97 \u2013 126 , 2001 . E. Fischer. The art of uninformed decisions: A primer to property testing. Bulletin of EATCS, 75:97\u2013126, 2001.","journal-title":"Bulletin of EATCS"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509977"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796411"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070011"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.13"},{"key":"e_1_3_2_1_18_1","first-page":"311","volume-title":"Proc. of 23rd COLT","author":"Lee H. K.","year":"2010","unstructured":"H. K. Lee . Learning talagrand DNF formulas . In Proc. of 23rd COLT , pages 310\u2013 311 , 2010 . H. K. Lee. Learning talagrand DNF formulas. In Proc. of 23rd COLT, pages 310\u2013311, 2010."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1958016.1958029"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10097"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/090756466"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2394539.2394565"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01844850"}],"event":{"name":"STOC '16: Symposium on Theory of Computing","location":"Cambridge MA USA","acronym":"STOC '16","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897567","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897518.2897567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:57Z","timestamp":1750222557000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,19]]},"references-count":24,"alternative-id":["10.1145\/2897518.2897567","10.1145\/2897518"],"URL":"https:\/\/doi.org\/10.1145\/2897518.2897567","relation":{},"subject":[],"published":{"date-parts":[[2016,6,19]]},"assertion":[{"value":"2016-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}