{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:25:35Z","timestamp":1787509535662,"version":"build-2736575974"},"reference-count":18,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2002.1004342","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T16:30:39Z","timestamp":1056558639000},"page":"73-79","source":"Crossref","is-referenced-by-count":4,"title":["Functions that have read-twice constant width branching programs are not necessarily testable"],"prefix":"10.1109","author":[{"given":"E.","family":"Fischer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"I.","family":"Newman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255151"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.24"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892112"},{"key":"16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0013-1_15","article-title":"Property testing (a tutorial)","author":"ron","year":"2001","journal-title":"Handbook of Randomized Computing"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285060"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258627"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509977"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103429"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814641"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070001"},{"key":"1","author":"alon","year":"1991","journal-title":"The Probabilistic Method"},{"key":"10","first-page":"97","article-title":"The an of uninformed decisions: A primer to property testing","volume":"75","author":"fischer","year":"2001","journal-title":"Bull Eur Assoc Theoret Comput Sci"},{"key":"7","first-page":"97","article-title":"Improved testing algorithms for monotonicity","author":"dodis","year":"1999","journal-title":"3rd RANDOM Conference Proceedings"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90044-W"},{"key":"5","first-page":"245","article-title":"Fast approximate PCPs for multidimensional bin-packing problems","author":"batu","year":"1999","journal-title":"RANDOM-APPROX99 Conference Proceedings"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20037"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2003.09.003"}],"event":{"name":"17th IEEE Annual Conference on Computational Complexity","location":"Montreal, Que., Canada","acronym":"CCC-02"},"container-title":["Proceedings 17th IEEE Annual Conference on Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7872\/21680\/01004342.pdf?arnumber=1004342","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T18:39:01Z","timestamp":1497551941000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1004342\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/ccc.2002.1004342","relation":{},"subject":[]}}