{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T11:59:06Z","timestamp":1787313546767,"version":"build-2736575974"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2004.1313851","type":"proceedings-article","created":{"date-parts":[[2004,11,12]],"date-time":"2004-11-12T19:14:14Z","timestamp":1100286854000},"page":"286-293","source":"Crossref","is-referenced-by-count":2,"title":["Graph properties and circular functions: how low can quantum query complexity go?"],"prefix":"10.1109","author":[{"family":"Xiaoming Sun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.C.","family":"Yao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"family":"Shengyu Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502097"},{"key":"2","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1006\/jcss.2002.1826","article-title":"Quantum lower bounds by quantum arguments","volume":"64","author":"ambainis","year":"2002","journal-title":"J Comput Sys Sci"},{"key":"10","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1137\/0220062","article-title":"CREW PRAMS and decision trees","volume":"20","author":"nisan","year":"1991","journal-title":"SIAM Journal on Computing"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214418"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00144-X"},{"key":"6","first-page":"820","article-title":"Quantum counting","volume":"1443","author":"brassard","year":"1998","journal-title":"LNCS"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(78)90030-8"},{"key":"4","author":"best","year":"1974","journal-title":"A Sharpened Version of the Aanderaa-Rosenberg Conjecture"},{"key":"9","first-page":"291","article-title":"Quantum search on bounded-error inputs","author":"hoyer","year":"0","journal-title":"ICA-2003"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90053-0"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90019-X"}],"event":{"name":"Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.","location":"Amherst, MA, USA"},"container-title":["Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9188\/29139\/01313851.pdf?arnumber=1313851","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T07:52:47Z","timestamp":1497599567000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1313851\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/ccc.2004.1313851","relation":{},"subject":[]}}