{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:29:29Z","timestamp":1787502569515,"version":"build-2736575974"},"reference-count":0,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[1990,3]]},"abstract":"<jats:p>\n                    We consider the problem of evaluating a boolean function P(x\n                    <jats:sub>1<\/jats:sub>\n                    ,\u2026,x\n                    <jats:sub>n<\/jats:sub>\n                    ), by asking queries of the form \u201cx\n                    <jats:sub>i<\/jats:sub>\n                    =?\u201d, and receiving answers which may not always be truthful. Assuming that the total number of lies does not exceed E, we present an algorithm with cost O(n+s\n                    <jats:sub>P<\/jats:sub>\n                    E+t\n                    <jats:sub>P<\/jats:sub>\n                    E), where s\n                    <jats:sub>P<\/jats:sub>\n                    is the maximal size of a minterm of P(x) and t\n                    <jats:sub>P<\/jats:sub>\n                    \u2018is the maximal size of a maxterm. We also prove that if P is monotone, then any algorithm for evaluating P must ask \u03a9(s\n                    <jats:sub>P<\/jats:sub>\n                    E+t\n                    <jats:sub>P<\/jats:sub>\n                    E) queries for some input.\n                  <\/jats:p>","DOI":"10.1142\/s0129054190000023","type":"journal-article","created":{"date-parts":[[2004,11,28]],"date-time":"2004-11-28T21:14:37Z","timestamp":1101676477000},"page":"1-10","source":"Crossref","is-referenced-by-count":19,"title":["ON EVALUATING BOOLEAN FUNCTIONS WITH UNRELIABLE TESTS"],"prefix":"10.1142","volume":"01","author":[{"given":"CLAIRE","family":"KENYON","sequence":"first","affiliation":[{"name":"DIMACS Center Rutgers University, Piscataway, NJ 08855, USA"},{"name":"Ecole Normale Sup\u00e9rieure 45 rue d\u2019Ulm, 75230 Paris Cedex 05, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"ANDREW C.","family":"YAO","sequence":"additional","affiliation":[{"name":"Computer Science Dept Princeton University, Princeton, NJ 08544, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2012,1,25]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054190000023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T18:48:34Z","timestamp":1565117314000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054190000023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":0,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,1,25]]},"published-print":{"date-parts":[[1990,3]]}},"alternative-id":["10.1142\/S0129054190000023"],"URL":"https:\/\/doi.org\/10.1142\/s0129054190000023","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}