{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T02:58:24Z","timestamp":1791341904091,"version":"4.3.1"},"reference-count":7,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1988,6]]},"abstract":"<jats:p>A Boolean function P from $\\{ {0,1} \\}^\\prime $ into $\\{ {0,1} \\}$ is said to be evasive, if every decision-tree algorithm for evaluating P must examine all t arguments in the worst case. It was known that any nontrivial monotone bipartite graph property on vertex set $V \\times W$ must be evasive, when $|V| \\cdot |W|$ is a power of a prime number. In this paper, we prove that every nontrivial monotone bipartite graph property is evasive.<\/jats:p>","DOI":"10.1137\/0217031","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:30:13Z","timestamp":1109226613000},"page":"517-520","source":"Crossref","is-referenced-by-count":35,"title":["Monotone Bipartite Graph Properties are Evasive"],"prefix":"10.1137","volume":"17","author":[{"given":"Andrew Chi-Chih","family":"Yao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"RBBL","unstructured":"M. Best, P. Van Ende Boas, H. W. Lenstra, Jr.,  A sharpened version of the Aanderra-Rosenberg Conjecture, Tech. Report, ZW 30\/74, Stichting Mathematisch Centrum, Amsterdam,  1974"},{"key":"RKSS","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579140"},{"key":"RMU","volume-title":"Elements of algebraic topology","author":"Munkres J.","year":"1984"},{"key":"RO","doi-asserted-by":"publisher","DOI":"10.1007\/BF02565743"},{"key":"RRV1","unstructured":"R. L. Rivest, J. Vuillemin,  On the number of argument evaluations required to compute boolean functions, Electronics Research Laboratory Memorandum, ERL-M472, Univ. of California, Berkeley, CA,  1974, October"},{"key":"RRV2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90053-0"},{"key":"RR","doi-asserted-by":"publisher","DOI":"10.1145\/1008299.1008302"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0217031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:43:55Z","timestamp":1787337835000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0217031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["10.1137\/0217031"],"URL":"https:\/\/doi.org\/10.1137\/0217031","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}